Sciweavers

6004 search results - page 619 / 1201
» Parallelizing query optimization
Sort
View
CONEXT
2009
ACM
15 years 7 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
ICCV
2009
IEEE
15 years 3 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
ICML
1998
IEEE
16 years 7 months ago
Q2: Memory-Based Active Learning for Optimizing Noisy Continuous Functions
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
Andrew W. Moore, Jeff G. Schneider, Justin A. Boya...
VLDB
2005
ACM
152views Database» more  VLDB 2005»
16 years 6 months ago
Composing, optimizing, and executing plans for bioinformatics web services
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
Snehal Thakkar, José Luis Ambite, Craig A. Knoblo...
173
Voted
ISPD
2010
ACM
217views Hardware» more  ISPD 2010»
16 years 1 months ago
ITOP: integrating timing optimization within placement
Timing-driven placement is a critical step in nanometerscale physical synthesis. To improve design timing on a global scale, net-weight based global timing-driven placement is a c...
Natarajan Viswanathan, Gi-Joon Nam, Jarrod A. Roy,...