Sciweavers

533 search results - page 100 / 107
» Playing games with approximation algorithms
Sort
View
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 8 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
CAV
2009
Springer
135views Hardware» more  CAV 2009»
14 years 8 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf
FOCS
2007
IEEE
14 years 1 months ago
Mechanism Design via Differential Privacy
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Frank McSherry, Kunal Talwar
RTSS
2002
IEEE
14 years 12 days ago
Maximizing the System Value while Satisfying Time and Energy Constraints
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
Cosmin Rusu, Rami G. Melhem, Daniel Mossé
CAD
2006
Springer
13 years 7 months ago
A rational extension of Piegl's method for filling n-sided holes
N-sided hole filling plays an important role in vertex blending. To deal with the case that the corner is surrounded by rational surfaces (i.e. NURBS surfaces), an algorithm to fi...
Yi-Jun Yang, Jun-Hai Yong, Hui Zhang, Jean-Claude ...