Sciweavers

539 search results - page 46 / 108
» Recurrence relations and fast algorithms
Sort
View
DAMON
2008
Springer
15 years 2 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
CIKM
2010
Springer
14 years 10 months ago
Wisdom of the ages: toward delivering the children's web with the link-based agerank algorithm
Though children frequently use web search engines to learn, interact, and be entertained, modern web search engines are poorly suited to children's needs, requiring relativel...
Karl Gyllstrom, Marie-Francine Moens
92
Voted
CIMCA
2005
IEEE
15 years 6 months ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
121
Voted
DPD
2002
168views more  DPD 2002»
15 years 8 days ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
RECOMB
2010
Springer
14 years 10 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...