Sciweavers

2505 search results - page 301 / 501
» A predictive model of menu performance
Sort
View
SIGSOFT
2007
ACM
14 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
KDD
2001
ACM
211views Data Mining» more  KDD 2001»
14 years 9 months ago
Magical thinking in data mining: lessons from CoIL challenge 2000
CoIL challenge 2000 was a supervised learning contest that attracted 43 entries. The authors of 29 entries later wrote explanations of their work. This paper discusses these repor...
Charles Elkan
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
14 years 2 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
14 years 2 months ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
CORR
2010
Springer
166views Education» more  CORR 2010»
13 years 9 months ago
Software Metrics Evaluation Based on Entropy
Abstract. Software engineering activities in the Industry has come a long way with various improvements brought in various stages of the software development life cycle. The comple...
R. Selvarani, T. R. Gopalakrishnan Nair, Muthu Ram...