Sciweavers

1478 search results - page 65 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 1 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
ICPR
2008
IEEE
14 years 3 months ago
Understanding vehicle motion via spatial integration of intensities
On a moving vehicle, speedy motion extraction from video is demanded. Different from the traditional motion estimation methods that track or match 2D features in consecutive motio...
Jiang Yu Zheng, Yasaswy Bhupalam, Hiromi T. Tanaka
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 1 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan