Sciweavers

2168 search results - page 314 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
125
Voted
LATA
2009
Springer
15 years 10 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
135
Voted
IPSN
2010
Springer
15 years 9 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 9 months ago
Optimal sensor hop selection: Sensor energy minimization and network lifetime maximization with guaranteed system performance
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
COMPGEOM
2003
ACM
15 years 8 months ago
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
François Labelle, Jonathan Richard Shewchuk
WSNA
2003
ACM
15 years 8 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng