Sciweavers

2926 search results - page 471 / 586
» Partially Optimal Routing
Sort
View
ALT
2009
Springer
16 years 17 hour ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
IROS
2008
IEEE
171views Robotics» more  IROS 2008»
15 years 9 months ago
Biomimetic grasp planning for cortical control of a robotic hand
— In this paper we outline a grasp planning system designed to augment the cortical control of a prosthetic arm and hand. A key aspect of this task is the presence of on-line use...
Matei T. Ciocarlie, Samuel T. Clanton, M. Chance S...
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 8 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
15 years 8 months ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...
CP
2003
Springer
15 years 8 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar