Sciweavers

387 search results - page 72 / 78
» Many Random Walks Are Faster Than One
Sort
View
CVPR
2012
IEEE
11 years 11 months 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
IMC
2005
ACM
14 years 2 months ago
Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems
During recent years, peer-to-peer (P2P) file-sharing systems have evolved in many ways to accommodate growing numbers of participating peers. In particular, new features have cha...
Daniel Stutzbach, Reza Rejaie, Subhabrata Sen
COMPGEOM
2010
ACM
14 years 2 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
BMCBI
2008
122views more  BMCBI 2008»
13 years 9 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 6 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra