2168 search results - page 255 / 434 » Randomized Algorithms and Complexity Theory |
134
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
126
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
119
Voted
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
115
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
133
Voted
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...