Sciweavers

2183 search results - page 98 / 437
» Multi-pass geometric algorithms
Sort
View
ICIP
2009
IEEE
13 years 7 months ago
Main subject detection via adaptive feature selection
In this paper we present an algorithm which uses adaptive selection of low-level features for main subject detection. The algorithm first computes low-level features such as contr...
Cuong T. Vu, Damon M. Chandler
GRAPHICSINTERFACE
2009
13 years 7 months ago
Recognizing interspersed sketches quickly
Sketch recognition is the automated recognition of hand-drawn diagrams. When allowing users to sketch as they would naturally, users may draw shapes in an interspersed manner, sta...
Tracy Anne Hammond, Randall Davis
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
12 years 15 days ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
13 years 11 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
GIS
2004
ACM
14 years 11 months ago
Time-dependent affine triangulation of spatio-temporal data
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
Sofie Haesevoets, Bart Kuijpers