3341 search results - page 627 / 669 » On Bounded Queries and Approximation |
261
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
197
click to vote
PODS
2005
ACM
16 years 5 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
206
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
166
click to vote
ICDM
2009
IEEE
16 years 10 days ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
192
click to vote
W2GIS
2009
Springer
16 years 8 days ago
2009
Springer
Abstract. A review is provided of some database and representation issues involved in the implementation of geographic information systems (GIS). The increasing popularity of web-b...