Sciweavers

752 search results - page 92 / 151
» Faster approximation algorithms for the minimum latency prob...
Sort
View
137
Voted
RECOMB
2005
Springer
16 years 3 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 3 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
RCIS
2010
15 years 1 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
145
Voted
NOSSDAV
2009
Springer
15 years 10 months ago
Cross-tree adjustment for spatialized audio streaming over networked virtual environments
In recent years, integrated spatialized voice services have become an appealing application for networked virtual environments (NVE), e.g., Second Life. With a spatialized voice s...
Ke Liang, Roger Zimmermann
129
Voted
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
15 years 7 months ago
Classifier prediction based on tile coding
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...