Sciweavers

285 search results - page 50 / 57
» The complexity of soft constraint satisfaction
Sort
View
TVCG
2002
109views more  TVCG 2002»
14 years 9 months ago
Robust Creation of Implicit Surfaces from Polygonal Meshes
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
Gary D. Yngve, Greg Turk
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
15 years 10 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
15 years 9 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
CBSE
2009
Springer
15 years 4 months ago
Selecting Fault Tolerant Styles for Third-Party Components with Model Checking Support
To build highly available or reliable applications out of unreliable third-party components, some software-implemented fault-tolerant mechanisms are introduced to gracefully deal w...
Junguo Li, Xiangping Chen, Gang Huang, Hong Mei, F...
EDOC
2007
IEEE
15 years 1 months ago
Automated Model-Based Configuration of Enterprise Java Applications
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
Jules White, Douglas C. Schmidt, Krzysztof Czarnec...