Sciweavers

11808 search results - page 244 / 2362
» Isometries and Computability Structures
Sort
View
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
15 years 25 days ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
ICALP
2004
Springer
15 years 11 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
Gianni Franceschini, Roberto Grossi
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 9 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
COLING
1996
15 years 7 months ago
An Underspecified HPSG Representation for Information Structure
hfformation structure can be of great use in linguistic applications, especially in those involving a speech component. However, focus marking by prosody is often ambiguous. Exist...
Jonas Kuhn
LACL
2001
Springer
15 years 10 months ago
Structural Equations in Language Learning
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
Michael Moortgat