Sciweavers

1446 search results - page 24 / 290
» Testing for Concise Representations
Sort
View
SIGGRAPH
1993
ACM
14 years 27 days ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
AAAI
2006
13 years 10 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
PARMA
2004
129views Database» more  PARMA 2004»
13 years 10 months ago
Towards a Language for Pattern Manipulation and Querying
Patterns are concise, but rich in semantic, representation of data. The approaches proposed in the literature to cope with pattern management problems usually deal with a single ty...
Elisa Bertino, Barbara Catania, Anna Maddalena
DKE
2007
101views more  DKE 2007»
13 years 8 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
FUIN
2007
90views more  FUIN 2007»
13 years 8 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier