Sciweavers

1813 search results - page 110 / 363
» Instance Pruning Techniques
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Tour the World: building a web-scale landmark recognition engine
Modeling and recognizing landmarks at world-scale is a useful yet challenging task. There exists no readily available list of worldwide landmarks. Obtaining reliable visual mode...
Yantao Zheng, Ming Zhao 0003, Yang Song, Hartwig A...
ICML
2008
IEEE
16 years 7 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 6 months ago
Identifying non-actionable association rules
Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action...
Bing Liu, Wynne Hsu, Yiming Ma
VLSID
2007
IEEE
97views VLSI» more  VLSID 2007»
16 years 6 months ago
Efficient Microprocessor Verification using Antecedent Conditioned Slicing
We present a technique for automatic verification of pipelined microprocessors using model checking. Antecedent conditioned slicing is an efficient abstraction technique for hardw...
Shobha Vasudevan, Vinod Viswanath, Jacob A. Abraha...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
16 years 6 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis