Sciweavers

1012 search results - page 22 / 203
» Segment intersection searching problems in general settings
Sort
View
ICDE
2007
IEEE
129views Database» more  ICDE 2007»
15 years 6 months ago
Ontology-driven Rule Generalization and Categorization for Market Data
—Radio Frequency Identification (RFID) is an emerging technique that can significantly enhance supply chain processes and deliver customer service improvements. RFID provides use...
Dongwoo Won, Dennis McLeod
COMPGEOM
2009
ACM
15 years 6 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
SIGIR
2010
ACM
15 years 3 months ago
Clicked phrase document expansion for sponsored search ad retrieval
We present a document expansion approach that uses Conditional Random Field (CRF) segmentation to automatically extract salient phrases from ad titles. We then supplement the ad d...
Dustin Hillard, Chris Leggetter
JAR
2000
149views more  JAR 2000»
14 years 11 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
CORR
2010
Springer
125views Education» more  CORR 2010»
14 years 11 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...