316 search results - page 31 / 64 » On the Space Complexity of Randomized Synchronization |
116
click to vote
TCAD
2008
15 years 11 days ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
89
Voted
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset...
95
Voted
CACM
2010
15 years 17 days ago
2010
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
120
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
101
click to vote
DAC
2000
ACM
16 years 1 months ago
2000
ACM
A main advantage of control composition with modal processes [4] is the enhanced retargetability of the composed behavior over a wide variety of target architectures. Unlike previ...