Sciweavers

50808 search results - page 10136 / 10162
» A New
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
12 years 9 days ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 9 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
12 years 9 days ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
CVPR
2012
IEEE
12 years 9 days ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
CVPR
2012
IEEE
12 years 9 days ago
Batch mode Adaptive Multiple Instance Learning for computer vision tasks
Multiple Instance Learning (MIL) has been widely exploited in many computer vision tasks, such as image retrieval, object tracking and so on. To handle ambiguity of instance label...
Wen Li, Lixin Duan, Ivor Wai-Hung Tsang, Dong Xu
« Prev « First page 10136 / 10162 Last » Next »