Sciweavers

1396 search results - page 194 / 280
» Succinct Dynamic Data Structures
Sort
View
TVLSI
2008
139views more  TVLSI 2008»
15 years 1 months ago
Ternary CAM Power and Delay Model: Extensions and Uses
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
Banit Agrawal, Timothy Sherwood
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 1 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
CAISE
2000
Springer
15 years 5 months ago
CHAOS: An Active Security Mediation System
With the emergence of the Internet, collaborative computing has become more feasible than ever. Organizations can share valuable information among each other. However, certain user...
David Liu, Kincho H. Law, Gio Wiederhold
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 5 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
VLDB
1999
ACM
131views Database» more  VLDB 1999»
15 years 5 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker