4911 search results - page 491 / 983 » Tree dependence analysis |
195
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
136
click to vote
AGILE
2009
Springer
16 years 22 days ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
153
Voted
INFOCOM
2006
IEEE
16 years 5 days ago
2006
IEEE
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
221
Voted
SMI
2006
IEEE
16 years 5 days ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
166
Voted
DCOSS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...