Sciweavers

CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 11 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
COMCOM
2008
85views more  COMCOM 2008»
13 years 11 months ago
Efficient placement of proxies for hierarchical reliable multicast
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
Liansheng Tan, Li Jin, Yi Pan
CN
2008
108views more  CN 2008»
13 years 11 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 11 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 11 months ago
A Unified Algorithmic Framework for Multi-Dimensional Scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is mo...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 11 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 11 months ago
Improved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
James King, David G. Kirkpatrick
CGF
2008
114views more  CGF 2008»
13 years 11 months ago
Displacement Mapping on the GPU - State of the Art
This paper reviews the latest developments of displacement mapping algorithms implemented on the vertex, geometry, and fragment shaders of graphics cards. Displacement mapping alg...
László Szirmay-Kalos, Tamás U...
CAGD
2008
80views more  CAGD 2008»
13 years 11 months ago
Division algorithms for Bernstein polynomials
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for c...
Laurent Busé, Ron Goldman
CGF
2010
189views more  CGF 2010»
13 years 11 months ago
Real-time Depth of Field Rendering via Dynamic Light Field Generation and Filtering
We present a new algorithm for efficient rendering of high-quality depth-of-field (DoF) effects. We start with a single rasterized view (reference view) of the scene, and sample t...
Xuan Yu, Rui Wang, Jingyi Yu