Sciweavers

697 search results - page 93 / 140
» Approximation of Information Granule Sets
Sort
View
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
OSDI
2004
ACM
14 years 10 months ago
Deploying Safe User-Level Network Services with icTCP
We present icTCP, an "information and control" TCP implementation that exposes key pieces of internal TCP state and allows certain TCP variables to be set in a safe fash...
Haryadi S. Gunawi, Andrea C. Arpaci-Dusseau, Remzi...
MM
2009
ACM
118views Multimedia» more  MM 2009»
14 years 4 months ago
Vocabulary-based hashing for image search
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...
Yingyu Liang, Jianmin Li, Bo Zhang
FOCS
2007
IEEE
14 years 4 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
WAIM
2007
Springer
14 years 4 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...