Sciweavers

4131 search results - page 662 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
TSD
2007
Springer
16 years 29 days ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
GLOBECOM
2006
IEEE
16 years 27 days ago
Logical Topology Design and Interface Assignment for Multi-Channel Wireless Mesh Networks
Abstract— A multi-channel wireless mesh network (MCWMN) consists of a number of stationary wireless routers, where each router is equipped with multiple network interface cards (...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
ICDCS
2006
IEEE
16 years 27 days ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 27 days ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
16 years 27 days ago
GPCD: Grid-based Predictive Collision Detection for Large-scale Environments in Computer Games
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
Zhiwen Yu, Hau-San Wong