Sciweavers

299 search results - page 51 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Relay selection methods for wireless cooperative communications
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Seunghoon Nam, Mai Vu, Vahid Tarokh
FUIN
2008
83views more  FUIN 2008»
13 years 7 months ago
Fault Diagnosis with Static and Dynamic Observers
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in t...
Franck Cassez, Stavros Tripakis
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
13 years 11 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
ICCV
2009
IEEE
15 years 18 days ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
IPPS
2006
IEEE
14 years 1 months ago
Skewed allocation of non-uniform data for broadcasting over multiple channels
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
Alan A. Bertossi, Maria Cristina Pinotti