Sciweavers

4926 search results - page 137 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
143
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
141
Voted
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 8 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
SAC
2010
ACM
15 years 11 months ago
Mining temporal relationships among categories
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
Saket S. R. Mengle, Nazli Goharian
CVPR
2007
IEEE
16 years 6 months ago
On-line Simultaneous Learning and Tracking of Visual Feature Graphs
Model learning and tracking are two important topics in computer vision. While there are many applications where one of them is used to support the other, there are currently only...
Arnaud Declercq, Justus H. Piater
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 8 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth