Sciweavers

308 search results - page 52 / 62
» How Fast Is the k-Means Method
Sort
View
130
Voted
CP
2011
Springer
14 years 3 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
124
Voted
HICSS
2000
IEEE
147views Biometrics» more  HICSS 2000»
15 years 7 months ago
ViCA - A WWW based Tool for Visualizing Project Status
Easy-to-access and up-to-date project status feedback is an important aspect of effective project management. When project data is collected, a common problem is how to present th...
Pekka Kilponen, Jari Vanhanen
153
Voted
KAIS
2002
144views more  KAIS 2002»
15 years 3 months ago
Correlation-Based Web Document Clustering for Adaptive Web Interface Design
A great challenge for web site designers is how to ensure users' easy access to important web pages efficiently. In this paper we present a clustering-based approach to addres...
Zhong Su, Qiang Yang, HongJiang Zhang, Xiaowei Xu,...
ICDM
2007
IEEE
147views Data Mining» more  ICDM 2007»
15 years 9 months ago
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collabo...
Robert M. Bell, Yehuda Koren
141
Voted
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 9 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...