Sciweavers

921 search results - page 150 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
123
Voted
IAT
2007
IEEE
15 years 10 months ago
Survey of Tools for Collaborative Knowledge Construction and Sharing
The fast growth and spread of Web 2.0 environments have demonstrated the great willingness of general Web users to contribute and share various type of content and information. Ma...
Gianluca Correndo, Harith Alani
130
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 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
SIGIR
2006
ACM
15 years 10 months ago
Near-duplicate detection by instance-level constrained clustering
For the task of near-duplicated document detection, both traditional fingerprinting techniques used in database community and bag-of-word comparison approaches used in information...
Hui Yang, James P. Callan
ALGORITHMICA
1999
84views more  ALGORITHMICA 1999»
15 years 3 months ago
Computational Approaches to Drug Design
Abstract. The rational approach to pharmaceutical drug design begins with an investigation of the relationship between chemical structure and biological activity. Information gaine...
Paul W. Finn, Lydia E. Kavraki
JSAC
2006
131views more  JSAC 2006»
15 years 3 months ago
On Dynamic Optimization of Packet Matching in High-Speed Firewalls
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer