1632 search results - page 213 / 327 » Sublinear Time Algorithms for Metric Space Problems |
156
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
154
Voted
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
158
click to vote
TDSC
2010
14 years 10 months ago
2010
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Edge services allow clients to access Internet service...
165
click to vote
CONSTRAINTS
1998
15 years 3 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
152
click to vote
DMIN
2008
15 years 5 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...