1632 search results - page 101 / 327 » Sublinear Time Algorithms for Metric Space Problems |
107
Voted
FOCS
1997
IEEE
15 years 7 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
130
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Achieving design closure is one of the biggest headaches for modern VLSI designers. This problem is exacerbated by high-level design automation tools that ignore increasingly impo...
184
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
112
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
132
click to vote
ISMIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...