Sciweavers

4541 search results - page 769 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
181
Voted
ECCV
2010
Springer
15 years 10 months ago
Bundle Adjustment in the Large
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
DAC
2010
ACM
15 years 10 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 10 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
ECAI
2004
Springer
15 years 10 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou