Sciweavers

820 search results - page 48 / 164
» Finding low-utility data structures
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
AAAI
2006
13 years 10 months ago
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nich...
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 9 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
CCCG
2008
13 years 10 months ago
Polar Diagram of Moving Objects
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using t...
Mojtaba Nouri Bygi, Mohammad Ghodsi
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 10 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang