Sciweavers

2370 search results - page 325 / 474
» A Structured Set of Higher-Order Problems
Sort
View
134
Voted
EVOW
2007
Springer
15 years 9 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...
143
Voted
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 5 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
152
Voted
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 5 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
134
Voted
COLING
1992
15 years 4 months ago
The Proper Treatment Of Word Order In HPSG
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
Karel Oliva
152
Voted
BMCBI
2007
161views more  BMCBI 2007»
15 years 3 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo