Sciweavers

6202 search results - page 40 / 1241
» Without Loss of Generality
Sort
View
115
Voted
APPML
2007
57views more  APPML 2007»
15 years 2 months ago
On plane bipartite graphs without fixed edges
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
Khaled Salem, Sandi Klavzar
SLOGICA
2008
92views more  SLOGICA 2008»
15 years 1 months ago
Applied Logic without Psychologism
Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical a...
Gregory R. Wheeler
JMLR
2010
139views more  JMLR 2010»
14 years 8 months ago
Causal learning without DAGs
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
David Duvenaud, Daniel Eaton, Kevin P. Murphy, Mar...
COLT
2005
Springer
15 years 3 months ago
Data Dependent Concentration Bounds for Sequential Prediction Algorithms
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
Tong Zhang
MOC
2002
108views more  MOC 2002»
15 years 1 months ago
Convergence of the multigrid $V$-cycle algorithm for second-order boundary value problems without full elliptic regularity
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
Susanne C. Brenner