Sciweavers

1512 search results - page 112 / 303
» connection 2006
Sort
View
JAIR
2010
130views more  JAIR 2010»
15 years 4 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
JAT
2010
71views more  JAT 2010»
15 years 4 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
JCT
2010
144views more  JCT 2010»
15 years 4 months ago
Combinatorics of generalized q-Euler numbers
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...
Tim Huber, Ae Ja Yee
JDA
2010
95views more  JDA 2010»
15 years 4 months ago
Sigma-local graphs
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
Prosenjit Bose, Sébastien Collette, Stefan ...
JGT
2010
128views more  JGT 2010»
15 years 4 months ago
On antimagic directed graphs
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
Dan Hefetz, Torsten Mütze, Justus Schwartz