Sciweavers

309 search results - page 33 / 62
» On a Balanced Property of Derangements
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
ASPLOS
2012
ACM
13 years 5 months ago
Chameleon: operating system support for dynamic processors
The rise of multi-core processors has shifted performance efforts towards parallel programs. However, single-threaded code, whether from legacy programs or ones difficult to para...
Sankaralingam Panneerselvam, Michael M. Swift
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 3 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
HICSS
2002
IEEE
148views Biometrics» more  HICSS 2002»
15 years 2 months ago
Barriers to a Wide-Area Trusted Network Early Warning System for Electric Power Disturbances
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...
Paul W. Oman, Jeff Roberts
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 4 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...