210 search results - page 14 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
EDBT
1998
ACM
14 years 25 days ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
COMPGEOM
1997
ACM
14 years 24 days ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
LICS
1997
IEEE
14 years 24 days ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...