683 search results - page 34 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
PPOPP
2010
ACM
14 years 5 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
BMCBI
2007
13 years 7 months ago
2007
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...