Sciweavers

377 search results - page 17 / 76
» Linear Tabling Strategies and Optimizations
Sort
View
CHI
2010
ACM
14 years 3 months ago
Lumino: tangible blocks for tabletop computers based on glass fiber bundles
Tabletop computers based on diffuse illumination can track fiducial markers placed on the table’s surface. In this paper, we demonstrate how to do the same with objects arranged...
Patrick Baudisch, Torsten Becker, Frederik Rudeck
BIOCOMP
2007
13 years 10 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
PSB
2003
13 years 10 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 9 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking sep-CMA-ES on the BBOB-2009 noisy testbed
A partly time and space linear CMA-ES is benchmarked on the BBOB-2009 noisy function testbed. This algorithm with a multistart strategy with increasing population size solves 10 f...
Raymond Ros