Sciweavers

1012 search results - page 4 / 203
» Segment intersection searching problems in general settings
Sort
View
WWW
2008
ACM
16 years 8 days ago
Unsupervised query segmentation using generative language models and wikipedia
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...
Bin Tan, Fuchun Peng
CVPR
2001
IEEE
16 years 1 months ago
Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
Graham D. Finlayson, Gerald Schaefer
DAM
2011
14 years 6 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
CCCG
2001
15 years 1 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
VLDB
1990
ACM
179views Database» more  VLDB 1990»
15 years 3 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish