Sciweavers

62 search results - page 5 / 13
» Picking the best DAISY
Sort
View
71
Voted
VLDB
1995
ACM
96views Database» more  VLDB 1995»
15 years 1 months ago
The Fittest Survives: An Adaptive Approach to Query Optimization
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Hongjun Lu, Kian-Lee Tan, Son Dao
91
Voted
AAAI
2006
14 years 11 months ago
Running the Table: An AI for Computer Billiards
Billiards is a game of both strategy and physical skill. To succeed, a player must be able to select strong shots, and then execute them accurately and consistently. Several robot...
Michael Smith
BMVC
2010
14 years 8 months ago
A general boosting-based framework for active object recognition
We propose a novel general framework with a boosting algorithm to achieve active object classification by view selection. The proposed framework actively decides the next best vie...
Zhaoyin Jia, Yao-Jen Chang, Tsuhan Chen
SOFTWARE
2011
14 years 5 months ago
A Synergetic Approach to Throughput Computing on x86-Based Multicore Desktops
In the era of multicores, many applications that tend to require substantial compute power and data crunching (aka Throughput Computing Applications) can now be run on desktop PCs...
Chi-Keung Luk, Ryan Newton, William Hasenplaugh, M...
88
Voted
FOCS
2008
IEEE
14 years 11 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...