Sciweavers

3257 search results - page 179 / 652
» Some Results on Effective Randomness
Sort
View
81
Voted
FUIN
2006
139views more  FUIN 2006»
14 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
JGAA
2007
142views more  JGAA 2007»
14 years 10 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
99
Voted
MP
2007
95views more  MP 2007»
14 years 9 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
ICIP
2005
IEEE
15 years 11 months ago
Segmenting non stationary images with triplet Markov fields
The hidden Markov field (HMF) model has been used in many model-based solutions to image analysis problems, including that of image segmentation, and generally gives satisfying re...
Dalila Benboudjema, Wojciech Pieczynski
IPMI
2009
Springer
15 years 11 months ago
Bayesian Registration via Local Image Regions: Information, Selection and Marginalization
We propose a novel Bayesian registration formulation in which image location is represented as a latent random variable. Location is marginalized to determine the maximum a priori ...
Matthew Toews, William M. Wells III