Sciweavers

7742 search results - page 292 / 1549
» The Robustness of Level Sets
Sort
View
DLOG
2011
14 years 10 months ago
Relaxed Abduction: Robust Information Interpretation for Incomplete Models
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
17 years 1 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
ICCV
2003
IEEE
16 years 8 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
LCTRTS
2007
Springer
16 years 26 days ago
Combining source-to-source transformations and processor instruction set extensions for the automated design-space exploration o
Industry’s demand for flexible embedded solutions providing high performance and short time-to-market has led to the development of configurable and extensible processors. The...
Richard Vincent Bennett, Alastair Colin Murray, Bj...