Sciweavers

930 search results - page 20 / 186
» Color Differential Structure
Sort
View
PODC
2010
ACM
13 years 9 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
MFCS
2007
Springer
14 years 1 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril
ICARCV
2002
IEEE
121views Robotics» more  ICARCV 2002»
14 years 10 days ago
CIRES: a system for content-based retrieval in digital image libraries
This papers presents CIRES, a new online system for content-based retrieval in digital image libraries. Contentbased image retrieval systems have traditionally used color and text...
Qasim Iqbal, Jake K. Aggarwal
PVLDB
2010
131views more  PVLDB 2010»
13 years 5 months ago
XSACT: A Comparison Tool for Structured Search Results
Studies show that about 50% of web search is for information exploration purpose, where a user would like to investigate, compare, evaluate, and synthesize multiple relevant resul...
Ziyang Liu, Sivaramakrishnan Natarajan, Peng Sun, ...
AUSAI
2004
Springer
14 years 23 days ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang