Sciweavers

92 search results - page 17 / 19
» Structuring Optimizing Transformations and Proving Them Soun...
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 10 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
POPL
2008
ACM
15 years 9 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
ICASSP
2011
IEEE
14 years 1 months ago
Collaborative sources identification in mixed signals via hierarchical sparse modeling
A collaborative framework for detecting the different sources in mixed signals is presented in this paper. The approach is based on CHiLasso, a convex collaborative hierarchical s...
Pablo Sprechmann, Ignacio Ramírez, Pablo Ca...
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
15 years 2 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag