Sciweavers

16257 search results - page 138 / 3252
» D-finiteness: algorithms and applications
Sort
View
GECCO
2010
Springer
150views Optimization» more  GECCO 2010»
15 years 11 months ago
Object-level recombination of commodity applications
This paper presents ObjRecombGA, a genetic algorithm framework for recombining related programs at the object file level. A genetic algorithm guides the selection of object file...
Blair Foster, Anil Somayaji
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 10 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
PAMI
1998
87views more  PAMI 1998»
15 years 6 months ago
Learning Local Languages and Their Application to DNA Sequence Analysis
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
Takashi Yokomori, Satoshi Kobayashi
TIP
2002
102views more  TIP 2002»
15 years 6 months ago
Multilayered image representation: application to image compression
Abstract--The main contribution of this work is a new paradigm for image representation and image compression. We describe a new multilayered representation technique for images. A...
François G. Meyer, Amir Averbuch, Ronald R....
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon