Sciweavers

282 search results - page 29 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
STACS
1999
Springer
13 years 12 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
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 8 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
13 years 12 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
Jeffrey Scott Vitter, Min Wang
ATAL
2006
Springer
13 years 11 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
ICPR
2000
IEEE
13 years 11 months ago
Controlling On-Line Adaptation of a Prototype-Based Classifier for Handwritten Characters
Methods for controlling the adaptation process of an on-line handwritten character recognizer are studied. The classifier is based on the -nearest neighbor rule and it is adapted...
Vuokko Vuori, Jorma Laaksonen, Erkki Oja, Jari Kan...