Sciweavers

1363 search results - page 127 / 273
» The road coloring problem
Sort
View
ICTAI
2002
IEEE
15 years 11 months ago
A Clustering Based Approach to Efficient Image Retrieval
This paper addresses the issue of effective and efficient content based image retrieval by presenting a novel indexing and retrieval methodology that integrates color, texture, an...
Ruofei Zhang, Zhongfei Zhang
JCO
2011
113views more  JCO 2011»
15 years 1 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
TCS
2010
15 years 4 months ago
Class constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
ICIP
2003
IEEE
16 years 8 months ago
Histogram intersection kernel for image classification
In this paper we address the problem of classifying images, by exploiting global features that describe color and illumination properties, and by using the statistical learning pa...
Annalisa Barla, Francesca Odone, Alessandro Verri
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
15 years 12 months ago
Two Dimensional Parameterized Matching
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur