2004 search results - page 18 / 401 » Sampling from large graphs |
118
click to vote
JCB
2002
14 years 11 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
CGF
2005
14 years 11 months ago
2005
We present a technique which allows capture of 3D surface geometry and a useful class of BRDFs using extremely simple equipment. A standard digital camera with an attached flash s...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
106
click to vote
KDD
2007
ACM
16 years 3 days ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...