Sciweavers

3019 search results - page 106 / 604
» Approximating the Domatic Number
Sort
View
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 10 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
CAD
2008
Springer
15 years 6 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
CAD
2004
Springer
15 years 6 months ago
Isotopic approximations and interval solids
Given a nonsingular compact two-manifold F without boundary, we present methods for establishing a family of surfaces which can approximate F so that each approximant is ambient i...
Takis Sakkalis, Thomas J. Peters, Justin Bisceglio
INFOCOM
2010
IEEE
15 years 4 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 6 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy