Sciweavers

5595 search results - page 963 / 1119
» Comparing Subsumption Optimizations
Sort
View
ICML
2006
IEEE
16 years 5 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
152
Voted
WWW
2008
ACM
16 years 5 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
16 years 5 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...
MOBIHOC
2005
ACM
16 years 4 months ago
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
Jian Tang, Guoliang Xue, Weiyi Zhang
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
16 years 2 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young