33 search results - page 3 / 7 » Tractable database design through bounded treewidth |
MOBIHOC
2007
ACM
14 years 5 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
ICALP
2003
Springer
13 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
ADC
2008
Springer
14 years 4 days ago
2008
Springer
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. All p...
PODS
2010
ACM
13 years 11 months ago
2010
ACM
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...