Sciweavers

618 search results - page 30 / 124
» Computational Models of Natural Language Argument
Sort
View
114
Voted
ICALP
2004
Springer
15 years 8 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
124
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 3 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
118
Voted
CIVR
2008
Springer
213views Image Analysis» more  CIVR 2008»
15 years 5 months ago
Language modeling for bag-of-visual words image categorization
In this paper, we propose two ways of improving image classification based on bag-of-words representation [25]. Two shortcomings of this representation are the loss of the spatial...
Pierre Tirilly, Vincent Claveau, Patrick Gros
COLING
2002
15 years 3 months ago
A New Probabilistic Model for Title Generation
Title generation is a complex task involving both natural language understanding and natural language synthesis. In this paper, we propose a new probabilistic model for title gene...
Rong Jin, Alexander G. Hauptmann
120
Voted
HPDC
1997
IEEE
15 years 7 months ago
PARDIS: A Parallel Approach to CORBA
This paper describes PARDIS, a system containing explicit support for interoperability of PARallel DIStributed applications. PARDIS is based on the Common Object Request Broker Ar...
Katarzyna Keahey, Dennis Gannon