Sciweavers

210 search results - page 15 / 42
» Universal Booleanization of Constraint Models
Sort
View
SPAA
2005
ACM
14 years 3 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
CVPR
2009
IEEE
15 years 5 months ago
Understanding Videos, Constructing Plots - Learning a Visually Grounded Storyline Model from Annotated Videos
Analyzing videos of human activities involves not only recognizing actions (typically based on their appearances), but also determining the story/plot of the video. The storyline...
Abhinav Gupta (University of Maryland), Praveen Sr...
CAV
2000
Springer
197views Hardware» more  CAV 2000»
14 years 2 months ago
Bounded Model Construction for Monadic Second-Order Logics
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
Abdelwaheb Ayari, David A. Basin
MM
1997
ACM
133views Multimedia» more  MM 1997»
14 years 1 months ago
Supporting Similarity Queries in MARS
To address the emerging needs of applications that require access to and retrieval of multimediaobjects, we are developing the Multimedia Analysis and Retrieval System (MARS) in o...
Michael Ortega, Yong Rui, Kaushik Chakrabarti, Sha...
PLDI
2009
ACM
14 years 4 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...