Sciweavers

1326 search results - page 111 / 266
» Adaptable Similarity Search using Non-Relevant Information
Sort
View
EOR
2010
140views more  EOR 2010»
15 years 3 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
15 years 9 months ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu
ADT
2006
15 years 6 months ago
TICP: Transport Information Collection Protocol
We present and validate TICP, a TCP-friendly reliable transport protocol to collect information from a large number of sources spread over the Internet. TICP is a stand-alone proto...
Chadi Barakat, Mohammad Malli, Naomichi Nonaka
ICML
2005
IEEE
16 years 7 months ago
Q-learning of sequential attention for visual object recognition from informative local descriptors
This work provides a framework for learning sequential attention in real-world visual object recognition, using an architecture of three processing stages. The first stage rejects...
Lucas Paletta, Gerald Fritz, Christin Seifert
ICTIR
2009
Springer
16 years 28 days ago
Modeling Expected Utility of Multi-session Information Distillation
Abstract. An open challenge in information distillation is the evaluation and optimization of the utility of ranked lists with respect to flexible user interactions over multiple ...
Yiming Yang, Abhimanyu Lad