Sciweavers

DAM
2006
100views more  DAM 2006»
13 years 9 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
DAM
2006
81views more  DAM 2006»
13 years 9 months ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
DAM
2006
68views more  DAM 2006»
13 years 9 months ago
A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
An algorithm for solving m
Peter Butkovic, Karel Zimmermann
CSDA
2006
85views more  CSDA 2006»
13 years 9 months ago
Fast and compact smoothing on large multidimensional grids
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
Paul H. C. Eilers, Iain D. Currie, María Du...
CSDA
2006
91views more  CSDA 2006»
13 years 9 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 9 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
CPC
2006
116views more  CPC 2006»
13 years 9 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 9 months ago
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...
Julien Robert, Nicolas Schabanel
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 9 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 9 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar