Sciweavers

1940 search results - page 203 / 388
» Optimizing search engines using clickthrough data
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 6 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
ICSE
1993
IEEE-ACM
15 years 10 months ago
A Comprehensive Process Model for Studying Software Process Papers
E cient and e ective studying of scienti c papers is an important part of software engineering education. Moreover, it contributes to the knowledge necessary to carry out software...
Rudolf K. Keller, Richard Lajoie, Nazim H. Madhavj...
PPPJ
2004
ACM
15 years 12 months ago
Visualization and analysis of phased behavior in Java programs
To enable analysis and visualization of phased behavior in Java programs and to facilitate optimization development, we have implemented a freely-available, phase analysis framewo...
Priya Nagpurkar, Chandra Krintz
ICPR
2008
IEEE
16 years 7 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...