Sciweavers

685 search results - page 86 / 137
» Closure Operators for Order Structures
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 8 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
STDBM
2004
Springer
143views Database» more  STDBM 2004»
15 years 7 months ago
Indexing Query Regions for Streaming Geospatial Data
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
Quinn Hart, Michael Gertz
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 6 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
IPPS
2000
IEEE
15 years 6 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
COMCOM
2006
283views more  COMCOM 2006»
15 years 2 months ago
Sleep scheduling for wireless sensor networks via network flow model
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
Rick W. Ha, Pin-Han Ho, Sherman X. Shen, Junshan Z...