Sciweavers

2100 search results - page 307 / 420
» Fundamentals of the problem
Sort
View
COMGEO
2008
ACM
13 years 9 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 9 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 9 months ago
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI technique...
Zvika Ben-Haim, Tomer Michaeli, Yonina C. Eldar
BMCBI
2006
98views more  BMCBI 2006»
13 years 9 months ago
The Secrets of a Functional Synapse - From a Computational and Experimental Viewpoint
Background: Neuronal communication is tightly regulated in time and in space. The neuronal transmission takes place in the nerve terminal, at a specialized structure called the sy...
Michal Linial
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 9 months ago
Source coding and channel requirements for unstable processes
Our understanding of information in systems has been based on the foundation of memoryless processes. Extensions to stable Markov and auto-regressive processes are classical. Berg...
Anant Sahai, Sanjoy K. Mitter