5962 search results - page 39 / 1193 » Efficient Clustering for Orders |
108
click to vote
ICCV
1999
IEEE
16 years 3 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
189
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it i...
206
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
119
click to vote
DAC
2000
ACM
16 years 2 months ago
2000
ACM
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static orde...
CN
1998
15 years 1 months ago
1998
In this paper we study in what order a crawler should visit the URLs it has seen, in order to obtain more "important" pages first. Obtaining important pages rapidly can ...