Sciweavers

1142 search results - page 117 / 229
» Approximability of Clausal Constraints
Sort
View
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
16 years 6 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
ICCAD
2006
IEEE
189views Hardware» more  ICCAD 2006»
16 years 3 months ago
Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems
Energy-efficiency and power-awareness for electronic systems have been important design issues in hardware and software implementations. We consider the scheduling of periodic ha...
Jian-Jia Chen, Tei-Wei Kuo
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
16 years 27 days ago
Parameter Tuning for Differential Mining of String Patterns
Constraint-based mining has been proven to be extremely useful for supporting actionable pattern discovery. However, useful conjunctions of constraints that support domain driven ...
Jérémy Besson, Christophe Rigotti, I...
PPDP
2005
Springer
15 years 12 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
SMA
2003
ACM
262views Solid Modeling» more  SMA 2003»
15 years 11 months ago
t-FFD: free-form deformation by using triangular mesh
Soft tissue deformation based on tensegric modeling is proposed. This modeling is especially applicable for human females to reform/alter their body shape using tailor-made underg...
Kazuya G. Kobayashi, Katsutoshi Ootsubo