74 search results - page 7 / 15 » How Good is Almost Perfect |
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
DCG
2007
13 years 7 months ago
2007
Scalar functions defined on a topological space Ω are at the core of many applications such as shape matching, visualization and physical simulations. Topological persistence i...
SIGCOMM
2004
ACM
14 years 1 months ago
2004
ACM
The limitations of BGP routing in the Internet are often blamed for poor end-to-end performance and prolonged connectivity interruptions. Recent work advocates using overlays to e...