Sciweavers

2370 search results - page 294 / 474
» A Structured Set of Higher-Order Problems
Sort
View
FOCS
2007
IEEE
15 years 10 months ago
Mechanism Design via Differential Privacy
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Frank McSherry, Kunal Talwar
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
15 years 10 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
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 10 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
GI
2004
Springer
15 years 9 months ago
Type Safe Programming of XML-based Applications
: There is an emerging amount of software for generating and manipulating XML documents. This paper addresses the problem of guaranteeing the validity of dynamically generated XML ...
Martin Kempa, Volker Linnemann
ECCV
2000
Springer
15 years 8 months ago
Minimal Paths in 3D Images and Application to Virtual Endoscopy
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
Thomas Deschamps, Laurent D. Cohen