Sciweavers

198 search results - page 9 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 21 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
JCS
2000
148views more  JCS 2000»
13 years 7 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton
TCS
2002
13 years 7 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
APLAS
2009
ACM
14 years 2 months ago
Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...
Rupesh Nasre, Kaushik Rajan, Ramaswamy Govindaraja...
CIC
2004
118views Communications» more  CIC 2004»
13 years 9 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng