Sciweavers

922 search results - page 172 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
ICFP
2010
ACM
13 years 8 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 7 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
CORR
2010
Springer
188views Education» more  CORR 2010»
13 years 7 months ago
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible ...
Sahand Negahban, Pradeep Ravikumar, Martin J. Wain...
CORR
2010
Springer
268views Education» more  CORR 2010»
13 years 7 months ago
Bayesian Based Comment Spam Defending Tool
Spam messes up user's inbox, consumes network resources and spread worms and viruses. Spam is flooding of unsolicited, unwanted e mail. Spam in blogs is called blog spam or c...
Dhinaharan Nagamalai, Beatrice Cynthia Dhinakaran,...
DAM
2008
84views more  DAM 2008»
13 years 7 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti