Sciweavers

308 search results - page 18 / 62
» How Fast Is the k-Means Method
Sort
View
142
Voted
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 4 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
131
Voted
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
15 years 10 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
135
Voted
IROS
2006
IEEE
171views Robotics» more  IROS 2006»
15 years 9 months ago
Fast central catadioptric line extraction, estimation, tracking and structure from motion
— In this paper we present an analysis of 3D line projections for central catadioptric cameras from a projective perspective. Most algorithms consider the projection of lines as ...
Christopher Mei, Ezio Malis
CVPR
2008
IEEE
16 years 5 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman
133
Voted
ICIP
2003
IEEE
16 years 5 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...