Sciweavers

87 search results - page 17 / 18
» Separation and Approximation of Polyhedral Objects
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 10 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
SIGGRAPH
1996
ACM
13 years 9 months ago
Interactive Multiresolution Surface Viewing
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
Andrew Certain, Jovan Popovic, Tony DeRose, Tom Du...
JMLR
2008
168views more  JMLR 2008»
13 years 5 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 9 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
CGF
2006
191views more  CGF 2006»
13 years 5 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt