Sciweavers

804 search results - page 142 / 161
» On the Termination of the Chase Algorithm
Sort
View
105
Voted
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 1 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
SIGIR
2011
ACM
14 years 1 months ago
Active learning to maximize accuracy vs. effort in interactive information retrieval
We consider an interactive information retrieval task in which the user is interested in finding several to many relevant documents with minimal effort. Given an initial documen...
Aibo Tian, Matthew Lease
PODC
2012
ACM
13 years 19 days ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
86
Voted
RECOMB
2001
Springer
15 years 10 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
SIGGRAPH
1999
ACM
15 years 2 months ago
Real-Time Acoustic Modeling for Distributed Virtual Environments
Realistic acoustic modeling is essential for spatializing sound in distributed virtual environments where multiple networked users move around and interact visually and aurally in...
Thomas A. Funkhouser, Patrick Min, Ingrid Carlbom