Sciweavers

1795 search results - page 227 / 359
» Search by strategy
Sort
View
ECCV
2010
Springer
15 years 11 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 11 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
15 years 10 months ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...
CSCLP
2008
Springer
15 years 8 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
ERCIMDL
2008
Springer
126views Education» more  ERCIMDL 2008»
15 years 8 months ago
An Extensible Virtual Digital Libraries Generator
In this paper we describe the design and implementation of the VDL Generator, a tool to simplify and automatise the Digital Library development process. In particular, we discuss h...
Massimiliano Assante, Leonardo Candela, Donatella ...