4516 search results - page 823 / 904 » Data Structures in the Design of Interfaces |
106
click to vote
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
120
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
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 5 months ago
2010
ACM
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...
140
click to vote
CSL
2006
Springer
15 years 5 months ago
2006
Springer
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
106
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...