Sciweavers

1105 search results - page 145 / 221
» Approximate Spectral Clustering.
Sort
View
ECCV
2006
Springer
13 years 11 months ago
Learning Semantic Scene Models by Trajectory Analysis
Abstract. In this paper, we describe an unsupervised learning framework to segment a scene into semantic regions and to build semantic scene models from longterm observations of mo...
Xiaogang Wang, Kinh Tieu, Eric Grimson
PR
2008
170views more  PR 2008»
13 years 7 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
VISUALIZATION
2002
IEEE
14 years 19 days ago
Efficient Simplification of Point-Sampled Surfaces
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
Mark Pauly, Markus H. Gross, Leif Kobbelt
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 8 months ago
Detecting time series motifs under uniform scaling
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
Dragomir Yankov, Eamonn J. Keogh, Jose Medina, Bil...
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 9 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu