Sciweavers

148 search results - page 10 / 30
» Fast Data Anonymization with Low Information Loss
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
BTW
2009
Springer
240views Database» more  BTW 2009»
13 years 8 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
AUSDM
2008
Springer
188views Data Mining» more  AUSDM 2008»
13 years 9 months ago
Priority Driven K-Anonymisation for Privacy Protection
Given the threat of re-identification in our growing digital society, guaranteeing privacy while providing worthwhile data for knowledge discovery has become a difficult problem. ...
Xiaoxun Sun, Hua Wang, Jiuyong Li
VLDB
1994
ACM
126views Database» more  VLDB 1994»
13 years 11 months ago
Building a Laboratory Information System Around a C++-Based Object-Oriented DBMS
MapBase is a laboratory information system that has been supporting a high-throughput genome-mapping operation for the last three years. We chose to build MapBase around a C++-bas...
Nathan Goodman, Steve Rozen, Lincoln Stein
WICON
2008
13 years 9 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu