806 search results - page 67 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
143
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
140
click to vote
WCNC
2010
IEEE
15 years 8 months ago
2010
IEEE
—Controlled mobile helper nodes called data ferries have recently been proposed to bridge communications between disconnected nodes in a delay-tolerant manner. While existing wor...
150
click to vote
PRL
2006
15 years 4 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
175
click to vote
SC
2005
ACM
15 years 10 months ago
2005
ACM
In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynam...
159
click to vote
ER
2007
Springer
15 years 10 months ago
2007
Springer
XML Schema supports the specification of occurrence constraints by declaring values for its min/maxOccurs attributes. These constraints are structural in the sense that they rest...