Sciweavers

4378 search results - page 25 / 876
» On the Complexity of Ordered Colourings
Sort
View
MLQ
2007
108views more  MLQ 2007»
13 years 8 months ago
Coloring linear orders with Rado's partial order
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
Riccardo Camerlo, Alberto Marcone
WSCG
2004
139views more  WSCG 2004»
13 years 10 months ago
Methods for Indexing Stripes in Uncoded Structured Light Scanning Systems
This paper presents robust methods for determining the order of a sequence of stripes captured in an uncoded structured light scanning system, i.e. where all the stripes are proje...
Alan Robinson, Lyuba Alboul, Marcos A. Rodrigues
EACL
2003
ACL Anthology
13 years 10 months ago
NLP for Indexing and Retrieval of Captioned Photographs
We present a text-based approach for the automatic indexing and retrieval of digital photographs taken at crime scenes. Our research prototype, SOCIS, goes beyond keyword-based ap...
Horacio Saggion, Katerina Pastra, Yorick Wilks
SBACPAD
2005
IEEE
139views Hardware» more  SBACPAD 2005»
14 years 2 months ago
Chained In-Order/Out-of-Order DoubleCore Architecture
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
Miquel Pericàs, Adrián Cristal, Rube...
CVPR
2012
IEEE
11 years 11 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori