Sciweavers

253 search results - page 14 / 51
» When More Alternatives Lead to Less Choice
Sort
View
127
Voted
DAMON
2008
Springer
15 years 2 months ago
Fast scans and joins using flash drives
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
Mehul A. Shah, Stavros Harizopoulos, Janet L. Wien...
90
Voted
PR
2006
102views more  PR 2006»
15 years 10 days ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
ICDE
2007
IEEE
207views Database» more  ICDE 2007»
16 years 1 months ago
SIGOPT: Using Schema to Optimize XML Query Processing
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
Stelios Paparizos, Jignesh M. Patel, H. V. Jagadis...
CHI
2006
ACM
16 years 24 days ago
Getting the right design and the design right
We present a study comparing usability testing of a single interface versus three functionally equivalent but stylistically distinct designs. We found that when presented with a s...
Maryam Tohidi, William Buxton, Ronald Baecker, Abi...
161
Voted
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 2 days ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount