493 search results - page 88 / 99 » Quantum Query Complexity of Some Graph Problems |
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
112
click to vote
ERSHOV
2009
Springer
15 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
AAAI
2006
14 years 11 months ago
2006
Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences ...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...