1688 search results - page 277 / 338 » The Complexity of Rationalizing Matchings |
CONEXT
2007
ACM
14 years 2 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
3DPVT
2004
IEEE
14 years 1 months ago
2004
IEEE
We present a computational framework for the inference of dense descriptions from multiple view stereo with general camera placement. Thus far research on dense multiple view ster...
ASWEC
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose a software development method for enterprise applications that combines the use of the structural concepts provided by problem frames, and the use of the UML notation. ...