3020 search results - page 541 / 604 » Optimal partition trees |
115
click to vote
DOCENG
2009
ACM
15 years 10 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
149
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
122
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
141
click to vote
ICDCS
2008
IEEE
15 years 10 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. A...
125
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...