387 search results - page 73 / 78 » Many Random Walks Are Faster Than One |
FOCS
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
- Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Many studies have been conducted to improve performance of MCL. Al...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...