138 search results - page 24 / 28 » The Complexity of Quickly ORM-Decidable Sets |
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as m...
EDBT
2010
ACM
14 years 4 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
ALGOSENSORS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...