Sciweavers

22128 search results - page 4408 / 4426
» Research in Structural Computing
Sort
View
ICDT
2010
ACM
137views Database» more  ICDT 2010»
14 years 10 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
ICDT
2010
ACM
163views Database» more  ICDT 2010»
14 years 10 months ago
Composing Local-As-View Mappings
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia Arocena, Ariel Fuxman, Renee Miller
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 10 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
DAGM
2010
Springer
14 years 10 months ago
Catheter Tracking: Filter-Based vs. Learning-Based
Abstract. Atrial fibrillation is the most common sustained arrhythmia. One important treatment option is radio-frequency catheter ablation (RFCA) of the pulmonary veins attached t...
Alexander Brost, Andreas Wimmer, Rui Liao, Joachim...
EDBT
2010
ACM
181views Database» more  EDBT 2010»
14 years 10 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...
« Prev « First page 4408 / 4426 Last » Next »