Sciweavers

237 search results - page 25 / 48
» Methods for Achieving Fast Query Times in Point Location Dat...
Sort
View
MMS
2010
13 years 2 months ago
InstantLeap: an architecture for fast neighbor discovery in large-scale P2P VoD streaming
In large-scale peer-to-peer (P2P) Video-on-Demand (VoD) streaming applications, a fundamental challenge is to quickly locate new supplying peers whenever a VCR command is issued, ...
Xuanjia Qiu, Wei Huang, Chuan Wu, Francis C. M. La...
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 2 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
PRL
2006
96views more  PRL 2006»
13 years 7 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
ET
2000
145views more  ET 2000»
13 years 7 months ago
Fast Test Pattern Generation for Sequential Circuits Using Decision Diagram Representations
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
Jaan Raik, Raimund Ubar
PCI
2009
Springer
14 years 13 days ago
Query Sensitive Storage for Wireless Sensor Networks
—Storage management in wireless sensor networks is an area that has started to attract significant attention, and several methods have been proposed, such as Local Storage (LS),...
Alexis Papadimitriou, Dimitrios Katsaros, Yannis M...