Sciweavers

836 search results - page 55 / 168
» On the Complexity of Train Assignment Problems
Sort
View
ICMLA
2007
15 years 5 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
15 years 10 months ago
Distance Coloring
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
Alexa Sharp
CVPR
2005
IEEE
16 years 5 months ago
Diagram Structure Recognition by Bayesian Conditional Random Fields
Hand-drawn diagrams present a complex recognition problem. Elements of the diagram are often individually ambiguous, and require context to be interpreted. We present a recognitio...
Yuan (Alan) Qi, Martin Szummer, Thomas P. Minka
ECCV
2006
Springer
16 years 5 months ago
Learning and Incorporating Top-Down Cues in Image Segmentation
Abstract. Bottom-up approaches, which rely mainly on continuity principles, are often insufficient to form accurate segments in natural images. In order to improve performance, rec...
Xuming He, Richard S. Zemel, Debajyoti Ray
IJBRA
2007
80views more  IJBRA 2007»
15 years 3 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip