Sciweavers

1208 search results - page 6 / 242
» On Counting Generalized Colorings
Sort
View
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
CVPR
2005
IEEE
14 years 9 months ago
Boosting Saliency in Color Image Features
The aim of salient point detection is to find distinctive events in images. Salient features are generally determined from the local differential structure of images. They focus o...
Joost van de Weijer, Theo Gevers
CVPR
2007
IEEE
14 years 9 months ago
Learning Color Names from Real-World Images
Within a computer vision context color naming is the action of assigning linguistic color labels to image pixels. In general, research on color naming applies the following paradi...
Joost van de Weijer, Cordelia Schmid, Jakob J. Ver...
ICPR
2004
IEEE
14 years 8 months ago
Online Learning of Color Transformation for Interactive Object Recognition under Various Lighting Conditions
This paper describes an online learning method of color transformation for interactive object recognition. In order to recognize objects under various lighting conditions, the sys...
Nobutaka Shimada, Yasushi Makihara, Yoshiaki Shira...
PODC
1993
ACM
13 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld