Sciweavers

4066 search results - page 126 / 814
» Almost Complete Sets
Sort
View
JTAER
2008
80views more  JTAER 2008»
15 years 6 months ago
Web 2.0 as Syndication
There is considerable excitement about the notion of 'Web 2.0', particularly among Internet businesspeople. In contrast, there is an almost complete lack of formal liter...
Roger Clarke
EJC
2007
15 years 6 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
ICIP
2009
IEEE
15 years 4 months ago
Blind deblurring of foreground-background images
This paper presents a method for deblurring an image consisting of two layers (a foreground layer and a background layer) which have suffered different, unknown blurs. This is a s...
Mariana S. C. Almeida, Luis B. Almeida
STACS
2012
Springer
14 years 1 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
JMLR
2006
103views more  JMLR 2006»
15 years 6 months ago
On Model Selection Consistency of Lasso
Sparsity or parsimony of statistical models is crucial for their proper interpretations, as in sciences and social sciences. Model selection is a commonly used method to find such...
Peng Zhao, Bin Yu