2004 search results - page 77 / 401 » Sampling from large graphs |
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...
103
click to vote
ESCIENCE
2007
IEEE
15 years 3 months ago
2007
IEEE
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
DM
2010
14 years 12 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
3DPVT
2006
IEEE
15 years 6 months ago
2006
IEEE
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
171
click to vote
WWW
2009
ACM
16 years 15 days ago
2009
ACM
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...