Sciweavers

7785 search results - page 1333 / 1557
» The Concept of Dynamic Analysis
Sort
View
MOBIHOC
2006
ACM
16 years 6 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
EWSN
2007
Springer
16 years 6 months ago
Energy Consumption of Minimum Energy Coding in CDMA Wireless Sensor Networks
Abstract. A theoretical framework is proposed for accurate performance analysis of minimum energy coding schemes in Coded Division Multiple Access (CDMA) wireless sensor networks. ...
Benigno Zurita Ares, Carlo Fischione, Karl Henrik ...
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
CVPR
2009
IEEE
16 years 4 months ago
A projector-camera setup for geometry-invariant frequency demultiplexing
Consider a projector-camera setup where a sinusoidal pattern is projected onto the scene, and an image of the objects imprinted with the pattern is captured by the camera. In this...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 4 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
« Prev « First page 1333 / 1557 Last » Next »