Sciweavers

14165 search results - page 396 / 2833
» The generalized two-server problem
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
End-to-end Scene Text Recognition
This paper focuses on the problem of word detection and recognition in natural images. The problem is significantly more challenging than reading text in scanned documents, and h...
Kai Wang, Boris Babenko, Serge Belongie
ISPD
2012
ACM
252views Hardware» more  ISPD 2012»
14 years 2 months ago
Towards layout-friendly high-level synthesis
There are two prominent problems with technology scaling: increasing design complexity and more challenges with interconnect design, including routability. High-level synthesis ha...
Jason Cong, Bin Liu 0006, Guojie Luo, Raghu Prabha...
JMLR
2012
13 years 9 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
CVPR
2012
IEEE
13 years 9 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 29 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn