Sciweavers

5981 search results - page 1002 / 1197
» time 2006
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
CPC
2006
110views more  CPC 2006»
15 years 6 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
CSDA
2006
233views more  CSDA 2006»
15 years 6 months ago
Analysis of Type-II progressively hybrid censored data
The mixture of Type-I and Type-II censoring schemes, called the hybrid censoring scheme is quite common in life-testing or reliability experiments. Recently Type-II progressive ce...
Debasis Kundu, Avijit Joarder
CSDA
2006
91views more  CSDA 2006»
15 years 6 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
CSDA
2006
108views more  CSDA 2006»
15 years 6 months ago
Repeated median and hybrid filters
Standard median filters preserve abrupt shifts (edges) and remove impulsive noise (outliers) from a constant signal but they deteriorate in trend periods. Finite impulse response ...
Roland Fried, Thorsten Bernholt, Ursula Gather
« Prev « First page 1002 / 1197 Last » Next »