Sciweavers

1492 search results - page 258 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Spectral Partitioning for Structure from Motion
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
Drew Steedly, Irfan A. Essa, Frank Dellaert
WWW
2009
ACM
15 years 10 months ago
The slashdot zoo: mining a social network with negative edges
We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other use...
Andreas Lommatzsch, Christian Bauckhage, Jé...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
CCGRID
2005
IEEE
15 years 3 months ago
Fast pattern-based throughput prediction for TCP bulk transfers
The ability to quickly predict the throughput of a TCP transfer between a client and a server, or between peers, has wide application in scientific computing and commercial compu...
Tsung-i Huang, Jaspal Subhlok
AAAI
2004
14 years 11 months ago
Distributed Representation of Syntactic Structure by Tensor Product Representation and Non-Linear Compression
Representing lexicons and sentences with the subsymbolic approach (using techniques such as Self Organizing Map (SOM) or Artificial Neural Network (ANN)) is a relatively new but i...
Heidi H. T. Yeung, Peter W. M. Tsang