Sciweavers

2252 search results - page 408 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Estimators also need shared values to grow together
—Network management applications require large numbers of counters in order to collect traffic characteristics for each network flow. However, these counters often barely fit ...
Erez Tsidon, Iddo Hanniel, Isaac Keslassy
VC
2008
190views more  VC 2008»
13 years 8 months ago
Fast collision detection using the A-buffer
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...
Han-Young Jang, JungHyun Han
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 16 days ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
MOBIHOC
2012
ACM
11 years 11 months ago
Channel width assignment using relative backlog: extending back-pressure to physical layer
With recent advances in Software-defined Radios (SDRs), it has indeed became feasible to dynamically adapt the channel widths at smaller time scales. Even though the advantages o...
Parth H. Pathak, Sankalp Nimbhorkar, Rudra Dutta
INFOCOM
2012
IEEE
11 years 11 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu