Sciweavers

589 search results - page 80 / 118
» Matching Concavity Trees
Sort
View
PCI
2005
Springer
15 years 3 months ago
Initial Experiences Porting a Bioinformatics Application to a Graphics Processor
Bioinformatics applications are one of the most relevant and compute-demanding applications today. While normally these applications are executed on clusters or dedicated parallel ...
Maria Charalambous, Pedro Trancoso, Alexandros Sta...
PPSN
2004
Springer
15 years 3 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
ADC
2008
Springer
143views Database» more  ADC 2008»
14 years 11 months ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
14 years 11 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
AAAI
1994
14 years 11 months ago
Using Induction to Refine Information Retrieval Strategies
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
Catherine Baudin, Barney Pell, Smadar Kedar