Sciweavers

494 search results - page 95 / 99
» The Conference Call Search Problem in Wireless Networks
Sort
View
AINA
2010
IEEE
14 years 25 days ago
Grid of Segment Trees for Packet Classification
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin
MOBISYS
2007
ACM
14 years 7 months ago
Context browsing with mobiles - when less is more
Except for a handful of "mobile" Web sites, the Web is designed for browsing with personal computers with large screens capable of fitting the content of most Web pages....
Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan
WCNC
2008
IEEE
14 years 2 months 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
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
14 years 7 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
JSA
2000
115views more  JSA 2000»
13 years 7 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani