Sciweavers

3778 search results - page 86 / 756
» Erdos-Ko-Rado for three sets
Sort
View
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 10 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
99
Voted
CIKM
2009
Springer
15 years 7 months ago
Fragment-based clustering ensembles
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
Ou Wu, Mingliang Zhu, Weiming Hu
111
Voted
ICCCN
2008
IEEE
15 years 7 months ago
Addressing Heterogeneity, Scalability, and Privacy in Layered Multicast Congestion Control
—Multicast is attracting a resurgence of interest because it has a potential to address the explosively growing need for efficient streaming of large-volume Internet content. Ho...
Sergey Gorinsky, K. K. Ramakrishnan, Harrick M. Vi...
111
Voted
MMM
2005
Springer
172views Multimedia» more  MMM 2005»
15 years 6 months ago
A Novel Approach of 3D Reconstruction of Human Face Using Monocular Camera
Three-dimensional model acquisition of an object is essential in many multimedia applications. Constructing three-dimensional models of objects from two-dimensional images is an o...
Ben Yip, Jesse S. Jin
GD
2004
Springer
15 years 6 months ago
No-Three-in-Line-in-3D
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
Attila Pór, David R. Wood