Sciweavers

1027 search results - page 161 / 206
» Ordered Vertex Partitioning
Sort
View
VLDB
2007
ACM
116views Database» more  VLDB 2007»
14 years 2 months ago
K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
Tochukwu Iwuchukwu, Jeffrey F. Naughton
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ICPADS
2006
IEEE
14 years 2 months ago
Coloring the Internet: IP Traceback
Several IP Traceback schemes employing packet marking have been proposed to trace DoS/DDoS attacks that use source address spoofing. The major challenges in the design of an ef...
Muthusrinivasan Muthuprasanna, G. Manimaran, Manso...
SRDS
2006
IEEE
14 years 2 months ago
Deleting Files in the Celeste Peer-to-Peer Storage System
Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the d...
Gal Badishi, Germano Caronni, Idit Keidar, Raphael...
ASPLOS
2006
ACM
14 years 2 months ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...