Sciweavers

8196 search results - page 221 / 1640
» Computational Modeling and Complexity Science
Sort
View
TLCA
2009
Springer
16 years 1 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
ACSC
2002
IEEE
15 years 11 months ago
Using Finite State Automata for Sequence Mining
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
Philip Hingston
FOCS
2002
IEEE
15 years 11 months ago
Market Equilibrium via a Primal-Dual-Type Algorithm
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...
Nikhil R. Devanur, Christos H. Papadimitriou, Amin...
GI
2009
Springer
15 years 4 months ago
An Evolutionary Strategy for Model-based Segmentation of Medical Data
: Medical image segmentation often involves variants of deformable models to account for both the variability of object shapes and variation in image quality. Segmentation quality,...
Karin Engel, Klaus D. Toennies
TCS
2010
15 years 1 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
Christian Mathissen