Sciweavers

2949 search results - page 357 / 590
» Universal Sparse Modeling
Sort
View
124
Voted
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 2 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
WSC
1996
15 years 2 months ago
Simulation for computer science majors: a preliminary report
The author is revising and restructuring an existing simulation course designed primarily for senior computer science majors by: 1) developing an integrated set of laboratory exer...
Ruth Silverman
COLING
1990
15 years 1 months ago
Three Typed Pragmatics for Dialogue Structure Analysis
An experimental system for dialogue structure analysis based on a new type plan recognition model for spoken dialogues has been implemented. This model is realized by using four t...
Hitoshi Iida, Takayuki Yamaoka, Hidekazu Arita
59
Voted
CORR
2006
Springer
66views Education» more  CORR 2006»
15 years 22 days ago
MDL Denoising Revisited
We refine and extend an earlier MDL denoising criterion for wavelet-based denoising. We start by showing that the denoising problem can be reformulated as a clustering problem, whe...
Teemu Roos, Petri Myllymäki, Jorma Rissanen
ENTCS
2006
151views more  ENTCS 2006»
15 years 21 days ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump