Sciweavers

9871 search results - page 142 / 1975
» On the Structure of Low Sets
Sort
View
WDAG
2009
Springer
130views Algorithms» more  WDAG 2009»
16 years 1 months ago
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
Gadi Taubenfeld
SECON
2008
IEEE
16 years 24 days ago
Adaptive Radio Modes in Sensor Networks: How Deep to Sleep?
—Energy-efficient performance is a central challenge in sensor network deployments, and the radio is a major contributor to overall energy node consumption. Current energyeffic...
Raja Jurdak, Antonio G. Ruzzelli, Gregory M. P. O'...
PERCOM
2008
ACM
16 years 6 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 11 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
ISCI
2008
116views more  ISCI 2008»
15 years 6 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu