Sciweavers

161 search results - page 24 / 33
» Setting port numbers for fast graph exploration
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
GLOBECOM
2008
IEEE
13 years 8 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
RAID
2005
Springer
14 years 1 months ago
Empirical Analysis of Rate Limiting Mechanisms
One class of worm defense techniques that received attention of late is to “rate limit” outbound traffic to contain fast spreading worms. Several proposals of rate limiting t...
Cynthia Wong, Stan Bielski, Ahren Studer, Chenxi W...
MICCAI
2008
Springer
14 years 9 months ago
Discovering Modes of an Image Population through Mixture Modeling
Abstract. We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The out...
Mert R. Sabuncu, Serdar K. Balci, Polina Golland
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 2 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han