Sciweavers

908 search results - page 138 / 182
» Temporal Analysis of Time Bounded Digital Systems
Sort
View
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
MOBIHOC
2005
ACM
15 years 9 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
SIGMETRICS
2010
ACM
173views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Channel fragmentation in dynamic spectrum access systems: a theoretical study
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
SCOPES
2004
Springer
15 years 3 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
DOCENG
2009
ACM
15 years 4 months ago
Declarative interfaces for dynamic widgets communications
Widgets are small and focused multimedia applications that can be found on desktop computers, mobile devices or even TV sets. Widgets rely on structured documents to describe thei...
Cyril Concolato, Jean Le Feuvre, Jean-Claude Dufou...