9209 search results - page 1354 / 1842 » Data Space Randomization |
210
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
180
click to vote
EUROSYS
2008
ACM
16 years 4 months ago
2008
ACM
Object replication is a common approach to enhance the availability of distributed data-intensive services and storage systems. Many such systems are known to have highly skewed o...
168
click to vote
ALT
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
196
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
137
click to vote
WWW
2010
ACM
16 years 2 months ago
2010
ACM
This paper establishes the theoretical framework of b-bit minwise hashing. The original minwise hashing method has become a standard technique for estimating set similarity (e.g.,...