Sciweavers

3894 search results - page 214 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
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...
IJAR
2006
98views more  IJAR 2006»
15 years 6 months ago
A forward-backward Monte Carlo method for solving influence diagrams
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
Andrés Cano, Manuel Gómez, Seraf&iac...
IPL
2008
111views more  IPL 2008»
15 years 6 months ago
Flying over a polyhedral terrain
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
Hamid Zarrabi-Zadeh
ALT
2004
Springer
16 years 3 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
ISPAN
1997
IEEE
15 years 10 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal