Sciweavers

1284 search results - page 136 / 257
» Data Structures for Mergeable Trees
Sort
View
CONPAR
1992
15 years 6 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
WSC
2007
15 years 4 months ago
Clinic: correlated inputs in an automotive paint shop fire risk simulation
General Motors (GM) has developed a first proof-ofconcept simulation model to explore impacts of various fire events in automotive paint shop operations. The approach uses a chron...
Debra A. Elkins, A. Christine LaFleur, Earnest Fos...
WSCG
2003
179views more  WSCG 2003»
15 years 3 months ago
Antipole Clustering for Fast Texture Synthesis
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic proce...
Sebastiano Battiato, Alfredo Pulvirenti, Diego Ref...
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 2 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
127
Voted
ICC
2007
IEEE
180views Communications» more  ICC 2007»
15 years 8 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu