Sciweavers

1061 search results - page 127 / 213
» Natural Selection in Relation to Complexity
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 6 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ICIP
2005
IEEE
14 years 10 months ago
Hexagonal versus orthogonal lattices: a new comparison using approximation theory
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
Laurent Condat, Dimitri Van De Ville, Thierry Blu
WWW
2010
ACM
14 years 4 months ago
What is disputed on the web?
We present a method for automatically acquiring of a corpus of disputed claims from the web. We consider a factual claim to be disputed if a page on the web suggests both that the...
Rob Ennals, Dan Byler, John Mark Agosta, Barbara R...
ICASSP
2009
IEEE
14 years 3 months ago
Resampling auxiliary data for language model adaptation in machine translation for speech
Performance of n-gram language models depends to a large extent on the amount of training text material available for building the models and the degree to which this text matches...
Sameer Maskey, Abhinav Sethy
ICAT
2007
IEEE
14 years 3 months ago
A PDA-based See-through Interface within an Immersive Environment
- With the use of an immersive display system such as the CAVE, the user is able to perceive a 3D environment realistically. However, the interaction on such systems faces some dif...
Miranda Miranda Miguel, Takefumi Ogawa, Kiyoshi Ki...