Sciweavers

592 search results - page 80 / 119
» Indexing Factors with Gaps
Sort
View
FOCS
2004
IEEE
14 years 1 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
FSTTCS
2006
Springer
14 years 1 months ago
Normal and Feature Approximations from Noisy Point Clouds
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
Tamal K. Dey, Jian Sun
RECOMB
2000
Springer
14 years 1 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
APGV
2008
ACM
126views Visualization» more  APGV 2008»
13 years 12 months ago
Effect of scenario on perceptual sensitivity to errors in animation
simulations compare to similar measurements done in more abstract settings. We find that participant tolerance for certain types of errors is significantly higher in a realistic sn...
Paul S. A. Reitsma, Carol O'Sullivan
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 12 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...