874 search results - page 135 / 175 » Faster Algorithms for Semi-Matching Problems |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
109
click to vote
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
183
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
EDBT
2002
ACM
15 years 10 months ago
2002
ACM
An important issue in data integration is the integration of semantically equivalent but schematically heterogeneous data sources. Declarative mechanisms supporting powerful source...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...