Sciweavers

322 search results - page 3 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
COMGEO
2008
ACM
13 years 5 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
UAI
2003
13 years 6 months ago
Active Collaborative Filtering
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
Craig Boutilier, Richard S. Zemel, Benjamin M. Mar...
AUTOMATICA
2006
113views more  AUTOMATICA 2006»
13 years 5 months ago
Least costly identification experiment for control
All approaches to optimal experiment design for control have so far focused on deriving an input signal (or input signal spectrum) that minimizes some control-oriented measure of ...
Xavier Bombois, Gérard Scorletti, Michel Ge...
WIOPT
2006
IEEE
13 years 11 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
CVPR
2009
IEEE
15 years 9 days ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...