Sciweavers

725 search results - page 34 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
15 years 10 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
ICIP
2010
IEEE
14 years 7 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard
WWW
2008
ACM
15 years 10 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
CVPR
2010
IEEE
15 years 5 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
96
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen