Sciweavers

196 search results - page 26 / 40
» A finite set of functions with an EXPTIME-complete compositi...
Sort
View
APAL
2008
104views more  APAL 2008»
14 years 11 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 11 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
78
Voted
CSC
2006
15 years 1 months ago
Normal Mode Analysis of the Chesapeake Bay Using COMSOL Multiphysics
Abstract A Normal Mode Analysis (NMA) of the Chesapeake Bay was performed using Neumann boundary conditions and COMSOL MultiPhysics (formerly known as FEMLAB). The lowest 100 eigen...
Kevin McIlhany, Reza Malek-Madani, Grant Gillary
EACL
2006
ACL Anthology
15 years 1 months ago
Inheritance and the CCG Lexicon
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
Mark McConville
JMLR
2002
137views more  JMLR 2002»
14 years 11 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller