Sciweavers

24 search results - page 4 / 5
» A characterization of uniquely vertex colorable graphs using...
Sort
View
CVPR
2007
IEEE
14 years 1 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
ICDE
2009
IEEE
245views Database» more  ICDE 2009»
14 years 9 months ago
WISE: A Workflow Information Search Engine
Workflows are widely used for representing business processes, web services, scientific experiments, and activities in daily life, like recipes. There is an increasing need for peo...
Qihong Shao, Peng Sun, Yi Chen
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 8 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
AMW
2009
13 years 8 months ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel