Sciweavers

15494 search results - page 411 / 3099
» Computing dynamic clusters
Sort
View
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 9 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
WWW
2009
ACM
16 years 7 months ago
Visual diversification of image search results
Due to the reliance on the textual information associated with an image, image search engines on the Web lack the discriminative power to deliver visually diverse search results. ...
Reinier H. van Leuken, Lluis Garcia Pueyo, Ximena ...
INFOCOM
2010
IEEE
15 years 5 months ago
Back-Pressure Routing for Intermittently Connected Networks
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
Jung Ryu, Lei Ying, Sanjay Shakkottai
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
16 years 1 months ago
Probabilistic mapping of dynamic obstacles using Markov chains for replanning in dynamic environments
— Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of...
Florian Rohrmüller, Matthias Althoff, Dirk Wo...
IEEEPACT
2000
IEEE
15 years 11 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte