Sciweavers

6568 search results - page 1198 / 1314
» Reducing the Complexity of Reductions
Sort
View
SEMCO
2008
IEEE
16 years 24 days ago
Using Similarity Measures for Context-Aware User Interfaces
Context-aware user interfaces facilitate the user interaction by suggesting or prefilling data derived from the user’s current context. This raises the problem of mapping conte...
Melanie Hartmann, Torsten Zesch, Max Mühlh&au...
WCNC
2008
IEEE
16 years 23 days ago
Three-Stage Serially Concatenated Codes and Iterative Center-Shifting K-Best Sphere Detection for SDM-OFDM: An EXIT Chart Aided
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
16 years 23 days ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
ICDCS
2007
IEEE
16 years 22 days ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
ICNS
2007
IEEE
16 years 22 days ago
DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
Changhua Sun, Lei Shi, Chengchen Hu, Bin Liu
« Prev « First page 1198 / 1314 Last » Next »