Sciweavers

7930 search results - page 306 / 1586
» Greedy in Approximation Algorithms
Sort
View
OPODIS
2008
15 years 8 months ago
Fast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
ESANN
2006
15 years 8 months ago
Efficient Forward Regression with Marginal Likelihood
We propose an efficient forward regression algorithm based on greedy optimization of marginal likelihood. It can be understood as a forward selection procedure which adds a new bas...
Ping Sun, Xin Yao
WG
2010
Springer
15 years 5 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
ICASSP
2008
IEEE
16 years 1 months ago
Generalized Gaussian Markov random field image restoration using variational distribution approximation
In this paper we propose novel algorithms for image restoration and parameter estimation with a Generalized Gaussian Markov Random Field prior utilizing variational distribution a...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
CRYPTO
2009
Springer
105views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Privacy-Enhancing Auctions Using Rational Cryptography
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Tr...