Sciweavers

9842 search results - page 1377 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
IPSN
2010
Springer
16 years 1 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
AVSS
2008
IEEE
16 years 1 months ago
Person Tracking with Audio-Visual Cues Using the Iterative Decoding Framework
Tracking humans in an indoor environment is an essential part of surveillance systems. Vision based and microphone array based trackers have been extensively researched in the pas...
Shankar T. Shivappa, Mohan M. Trivedi, Bhaskar D. ...
CEC
2008
IEEE
16 years 1 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
COMPSAC
2008
IEEE
16 years 1 months ago
Managing Libre Software Distributions under a Product Line Approach
Software product lines have already proven to be a successful methodology for building and maintaining a collection of similar software products, based on a common architecture. H...
Israel Herraiz, Gregorio Robles, Rafael Capilla, J...
« Prev « First page 1377 / 1969 Last » Next »