Sciweavers

10182 search results - page 353 / 2037
» Case Studies
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
STACS
1999
Springer
15 years 11 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
EWCBR
2004
Springer
16 years 5 days ago
Investigating Graphs in Textual Case-Based Reasoning
Textual case-based reasoning (TCBR) provides the ability to reason with domain-specific knowledge when experiences exist in text. Ideally, we would like to find an inexpensive way ...
Colleen Cunningham, Rosina Weber, Jason M. Proctor...
SIGIR
2009
ACM
16 years 1 months ago
A study of inter-annotator agreement for opinion retrieval
Evaluation of sentiment analysis, like large-scale IR evaluation, relies on the accuracy of human assessors to create judgments. Subjectivity in judgments is a problem for relevan...
Adam Bermingham, Alan F. Smeaton
ASPDAC
2007
ACM
74views Hardware» more  ASPDAC 2007»
15 years 10 months ago
A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
Tan Yan, Shuting Li, Yasuhiro Takashima, H. Murata