Sciweavers

206 search results - page 10 / 42
» Efficient adaptive collect using randomization
Sort
View
DIS
2006
Springer
14 years 8 days ago
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
Taneli Mielikäinen, Pance Panov, Saso Dzerosk...
IWMM
2000
Springer
108views Hardware» more  IWMM 2000»
14 years 5 days ago
Efficient Object Sampling via Weak References
The performance of automatic memory management may be improved if the policies used in allocating and collecting objects had knowledge of the lifetimes of objects. To date, approa...
Ole Agesen, Alex Garthwaite
3DOR
2008
13 years 11 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
JCO
2006
234views more  JCO 2006»
13 years 8 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
PDPTA
2003
13 years 10 months ago
Distributed Network Monitoring Using Mobile Agents Paradigm
Traditionally network monitoring and management has been done using predominantly centralized techniques. Mobile agents have been proposed as an alternative to this centralized app...
Farhad Kamangar, David Levine, Gergely V. Zá...