Sciweavers

2215 search results - page 185 / 443
» Wide open spaces
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 9 months 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...
CCR
2004
93views more  CCR 2004»
15 years 4 months ago
Enabling large-scale wireless broadband: the case for TAPs
Abstract-- The vision is tantalizing: a high-performance, scalable, and widely deployed wireless Internet that facilitates services ranging from radically new and unforeseen applic...
Roger Karrer, Ashutosh Sabharwal, Edward W. Knight...
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
16 years 6 months ago
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
Osman Abul, Francesco Bonchi, Mirco Nanni
SBBD
2008
256views Database» more  SBBD 2008»
15 years 6 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
AIEDAM
2011
14 years 11 months ago
Discovering implicit constraints in design
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
Madan Mohan Dabbeeru, Amitabha Mukerjee