Sciweavers

3250 search results - page 444 / 650
» Parameterized Learning Complexity
Sort
View
ICML
2004
IEEE
16 years 4 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
ICML
1996
IEEE
16 years 4 months ago
Searching for Structure in Multiple Streams of Data
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
Tim Oates, Paul R. Cohen
KDD
2002
ACM
160views Data Mining» more  KDD 2002»
16 years 4 months ago
Scaling multi-class support vector machines using inter-class confusion
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
Shantanu Godbole, Sunita Sarawagi, Soumen Chakraba...
CHI
2008
ACM
16 years 4 months ago
K-sketch: a 'kinetic' sketch pad for novice animators
Because most animation tools are complex and timeconsuming to learn and use, most animations today are created by experts. To help novices create a wide range of animations quickl...
Richard C. Davis, Brien Colwell, James A. Landay
CADE
2004
Springer
16 years 4 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...