Sciweavers

976 search results - page 94 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 3 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
COMPGEOM
1994
ACM
14 years 1 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
ASIACRYPT
2010
Springer
13 years 7 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ASIACRYPT
2008
Springer
13 years 11 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...