Sciweavers

137 search results - page 19 / 28
» Deformation Techniques for Efficient Polynomial Equation Sol...
Sort
View
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 7 months ago
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
Patrick Dehornoy
CP
2008
Springer
13 years 9 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
IJCAI
1989
13 years 8 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih
3DPVT
2006
IEEE
158views Visualization» more  3DPVT 2006»
13 years 11 months ago
Revealing Significant Medial Structure in Polyhedral Meshes
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
Svetlana Stolpner, Kaleem Siddiqi
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 11 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz