Sciweavers

1920 search results - page 81 / 384
» The Complexity of the A B C Problem
Sort
View
149
Voted
IJCV
2006
121views more  IJCV 2006»
15 years 6 months ago
Feature-Based Sequence-to-Sequence Matching
This paper studies the problem of matching two unsynchronized video sequences of the same dynamic scene, recorded by different stationary uncalibrated video cameras. The matching i...
Yaron Caspi, Denis Simakov, Michal Irani
146
Voted
SIGSOFT
1996
ACM
15 years 10 months ago
Tool Support for Planning the Restructuring of Data Abstractions in Large Systems
Abstractions in Large Systems William G. Griswold, Member, IEEE, Morison I. Chen, Robert W. Bowdidge, Jenny L. Cabaniss, Van B. Nguyen, and J. David Morgenthaler Restructuring soft...
William G. Griswold, Morison I. Chen, Robert W. Bo...
DSVIS
2003
Springer
15 years 11 months ago
Higher-Order Task Models
Based on a revision of the common task understanding in model-based approaches a formal meta model is proposed which allows more expressive task descriptions. A task is considered ...
Anke Dittmar, Peter Forbrig
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 6 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
145
Voted
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
15 years 7 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...