Sciweavers

1736 search results - page 281 / 348
» On antimagic directed graphs
Sort
View
CGF
2008
98views more  CGF 2008»
13 years 11 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 11 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 11 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
CSDA
2010
118views more  CSDA 2010»
13 years 11 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
DISOPT
2008
107views more  DISOPT 2008»
13 years 11 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin