Sciweavers

1232 search results - page 141 / 247
» Digraphs: theory, algorithms and applications
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
Half Quadratic Analysis for Mean Shift: with Extension to A Sequential Data Mode-Seeking Method
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorit...
Xiaotong Yuan, Stan Z. Li
WWW
2004
ACM
16 years 7 months ago
Experiments with persian text compression for web
The increasing importance of Unicode for text encoding implies a possible doubling of data storage space and data transmission time, with a corresponding need for data compression...
Farhad Oroumchian, Ehsan Darrudi, Fattane Taghiyar...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 6 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
ATAL
2009
Springer
16 years 1 months ago
Manipulation and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 29 days ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin