6274 search results - page 131 / 1255 » From query complexity to computational complexity |
157
click to vote
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
148
click to vote
MKWI
2008
15 years 5 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
114
click to vote
DATAMINE
2007
15 years 4 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
139
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
141
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...