Sciweavers

460 search results - page 38 / 92
» New Tools for Graph Coloring
Sort
View
COCOON
2009
Springer
14 years 2 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
CVIU
2004
155views more  CVIU 2004»
13 years 7 months ago
Object of interest-based visual navigation, retrieval, and semantic content identification system
This study presents a content-based image retrieval system IMALBUM based on local region of interest called object of interest (OOI). Each segmented or user-selected OOI is indexe...
Khalid Idrissi, Guillaume Lavoué, Julien Ri...
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 2 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
ACCV
2010
Springer
13 years 2 months ago
Learning Image Structures for Optimizing Disparity Estimation
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
M. V. Rohith, Chandra Kambhamettu
CHI
2004
ACM
14 years 8 months ago
I/O brush: drawing with everyday objects as ink
We introduce I/O Brush, a new drawing tool aimed at young children, ages four and up, to explore colors, textures, and movements found in everyday materials by "picking up&qu...
Kimiko Ryokai, Stefan Marti, Hiroshi Ishii