Sciweavers

831 search results - page 128 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 11 months ago
k-Anonymization Revisited
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-...
Aristides Gionis, Arnon Mazza, Tamir Tassa
ICDE
2007
IEEE
107views Database» more  ICDE 2007»
14 years 11 months ago
Many-to-Many Aggregation for Sensor Networks
Wireless sensor networks have enormous potential to aid data collection in a number of areas, such as environmental and wildlife research. In this paper, we address the challenges...
Adam Silberstein, Jun Yang 0001
CVPR
2007
IEEE
15 years 3 days ago
On Constant Focal Length Self-Calibration From Multiple Views
We investigate the problem of finding the metric structure of a general 3D scene viewed by a moving camera with square pixels and constant unknown focal length. While the problem ...
Adrien Bartoli, Alain Crouzil, Benoît Bocqui...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 2 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
14 years 4 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...