Sciweavers

367 search results - page 21 / 74
» Truncated incremental search
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
A Brute-Force Algorithm for Reconstructing a Scene from Two Projections
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences,...
Olof Enqvist, Fangyuan Jiang, Fredrik Kahl
ACMSE
2006
ACM
14 years 1 months ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith
AISC
2004
Springer
14 years 28 days ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
WSCG
2001
89views more  WSCG 2001»
13 years 9 months ago
Searching Triangle Strips Guided by Simplification Criterion
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
Oscar Belmonte, José Ribelles, Inmaculada R...
CLEF
2006
Springer
13 years 11 months ago
SINAI at CLEF 2006 Ad Hoc Robust Multilingual Track: Query Expansion Using the Google Search Engine
This year, we have participated on Ad-Hoc Robust Multilingual track with the aim to evaluate two issues of CLIR systems. Firstly, this paper describes the method followed for quer...
Fernando Martínez Santiago, Arturo Montejo ...