Sciweavers

820 search results - page 48 / 164
» Inducing Temporal Graphs
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
Object Tracking with Ratio Cycles Using Shape and Appearance Cues
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
Mehmet Emre Sargin, Pratim Ghosh, B. S. Manjunath,...
VLDB
2004
ACM
93views Database» more  VLDB 2004»
14 years 1 months ago
Indexing Temporal XML Documents
Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XM...
Alberto O. Mendelzon, Flavio Rizzolo, Alejandro A....
ECAI
2000
Springer
14 years 25 days ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
GECCO
2004
Springer
14 years 1 months ago
Finding Maximum Cliques with Distributed Ants
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
Thang Nguyen Bui, Joseph R. Rizzo
VC
1998
106views more  VC 1998»
13 years 8 months ago
Polyhedron realization for shape transformation
Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for ...
Avner Shapiro, Ayellet Tal