Sciweavers

1024 search results - page 91 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein
CCE
2004
14 years 9 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...
CSL
2004
Springer
14 years 9 months ago
Factor analysed hidden Markov models for speech recognition
Recently various techniques to improve the correlation model of feature vector elements in speech recognition systems have been proposed. Such techniques include semi-tied covaria...
Antti-Veikko I. Rosti, M. J. F. Gales
ASE
1998
81views more  ASE 1998»
14 years 9 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
IJRR
2002
66views more  IJRR 2002»
14 years 9 months ago
Morse Decompositions for Coverage Tasks
Exact cellular decompositions represent a robot's free space by dividing it into regions with simple structure such that the sum of the regions fills the free space. These de...
Ercan U. Acar, Howie Choset, Alfred A. Rizzi, Pras...