Sciweavers

321 search results - page 34 / 65
» A view selection algorithm with performance guarantee
Sort
View
PRL
2006
96views more  PRL 2006»
14 years 11 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
COLT
2005
Springer
15 years 29 days ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour
MOBIHOC
2008
ACM
15 years 10 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
81
Voted
ICASSP
2009
IEEE
14 years 8 months ago
Tree configuration games for distributed stream mining systems
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
16 years 11 days ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...