Sciweavers

16404 search results - page 543 / 3281
» A set coverage problem
Sort
View
JMLR
2010
88views more  JMLR 2010»
15 years 1 months ago
Unsupervised Aggregation for Classification Problems with Large Numbers of Categories
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
Ivan Titov, Alexandre Klementiev, Kevin Small, Dan...
ARC
2012
Springer
317views Hardware» more  ARC 2012»
14 years 2 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
INFOCOM
2012
IEEE
13 years 9 months ago
Optimal surface deployment problem in wireless sensor networks
—Sensor deployment is a fundamental issue in a wireless sensor network, which often dictates the overall network performance. Previous studies on sensor deployment mainly focused...
Miao Jin, Guodong Rong, Hongyi Wu, Liang Shuai, Xi...
ICCV
2007
IEEE
16 years 9 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
ECCV
2006
Springer
16 years 8 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...