Sciweavers

973 search results - page 190 / 195
» New Bounds on Crossing Numbers
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
IPM
2006
157views more  IPM 2006»
13 years 7 months ago
Collaborative bibliography
A bibliography is traditionally characterized by the judgments, bounded by explicit selection criteria, made by a single compiler. Because these criteria concern the attributes as...
David G. Hendry, J. R. Jenkins, Joseph F. McCarthy
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
EOR
2007
108views more  EOR 2007»
13 years 7 months ago
Probability density functions based weights for ordered weighted averaging (OWA) operators: An example of water quality indices
This paper explores the application of ordered weighted averaging (OWA) operators to develop water quality index, which incorporates an attitudinal dimension in the aggregation pr...
Rehan Sadiq, Solomon Tesfamariam
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro