Sciweavers

562 search results - page 52 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
HIS
2003
14 years 11 months ago
PDGA: the Primal-Dual Genetic Algorithm
Abstract. Genetic algorithms (GAs) are a class of search algorithms based on principles of natural evolution. Hence, incorporating mechanisms used in nature may improve the perform...
Shengxiang Yang
WIOPT
2010
IEEE
14 years 8 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos
AAAI
2000
14 years 11 months ago
Statistics-Based Summarization - Step One: Sentence Compression
When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one...
Kevin Knight, Daniel Marcu
TIP
2008
133views more  TIP 2008»
14 years 9 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)