Sciweavers

2436 search results - page 291 / 488
» Comonadic Notions of Computation
Sort
View
DESRIST
2009
Springer
79views Education» more  DESRIST 2009»
15 years 11 months ago
Power of peripheral designers: how users learn to design
In information system development, end-users often participate in design and in many cases learn to design their own system. Design, however, requires a distinct approach that use...
Yutaka Yamauchi
167
Voted
COLT
2001
Springer
15 years 11 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
EUROCOLT
1999
Springer
15 years 11 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
198
Voted
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
CIKM
2009
Springer
15 years 10 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han