Sciweavers

332 search results - page 2 / 67
» The Monochromatic Column problem
Sort
View
TKDE
2010
200views more  TKDE 2010»
13 years 6 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
CVPR
2010
IEEE
14 years 4 months ago
Learning to Recognize Shadows in Monochromatic Natural Images
This paper addresses the problem of recognizing shadows from monochromatic natural images. Without chromatic information, shadow classification is very challenging because the in...
Jiejie Zhu, Kegan Samuel, Syed Zain Masood, Marsha...
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 8 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
JCT
2006
168views more  JCT 2006»
13 years 8 months ago
Mono-multi bipartite Ramsey numbers, designs, and matrices
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
Paul N. Balister, András Gyárf&aacut...
JMLR
2012
11 years 11 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak