Sciweavers

1047 search results - page 116 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ICIP
2010
IEEE
13 years 6 months ago
Accelerated video encoding using render context information
In this paper, we present a method to speed up video encoding of GPU rendered 3D scenes, which is particularly suited for the efficient and low-delay encoding of 3D game output as...
Philipp Fechteler, Peter Eisert
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
14 years 7 days ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
DEXA
2007
Springer
150views Database» more  DEXA 2007»
14 years 2 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi
SARA
2005
Springer
14 years 1 months ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler