Sciweavers

1220 search results - page 73 / 244
» Dependent classes
Sort
View
TLCA
2007
Springer
14 years 3 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
14 years 2 months ago
Effective image compression using evolved wavelets
Wavelet-based image coders like the JPEG2000 standard are the state of the art in image compression. Unlike traditional image coders, however, their performance depends to a large...
Uli Grasemann, Risto Miikkulainen
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
DBPL
2001
Springer
133views Database» more  DBPL 2001»
14 years 1 months ago
A Theory of Spatio-Temporal Database Queries
Abstract. We address a fundamental question concerning spatio-temporal database systems: “What are exactly spatio-temporal queries?” We define spatio-temporal queries to be co...
Floris Geerts, Sofie Haesevoets, Bart Kuijpers
LATIN
2010
Springer
14 years 18 days ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska