Sciweavers

70 search results - page 14 / 14
» Dealing with Incomplete Preferences in Soft Constraint Probl...
Sort
View
SIGIR
2008
ACM
13 years 5 months ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum
DEXA
2005
Springer
108views Database» more  DEXA 2005»
13 years 10 months ago
Quality-Aware Replication of Multimedia Data
In contrast to alpha-numerical data, multimedia data can have a wide range of quality parameters such as spatial and temporal resolution, and compression format. Users can request ...
Yi-Cheng Tu, Jingfeng Yan, Sunil Prabhakar
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
13 years 11 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
DPC
1996
192views more  DPC 1996»
13 years 6 months ago
Finding Pictures of Objects in Large Collections of Images
Retrieving images from very large collections, using image content as a key, is becoming an important problem. Users prefer to ask for pictures using notions of content that are st...
David A. Forsyth, Jitendra Malik, Thomas K. Leung,...
JAIR
2006
179views more  JAIR 2006»
13 years 5 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert