Sciweavers

3394 search results - page 77 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
COMGEO
2006
ACM
13 years 7 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
ICALP
2009
Springer
14 years 8 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
WSCG
2003
174views more  WSCG 2003»
13 years 9 months ago
An Efficient Algorithm for Codebook Design in Transform Vector Quantization
In this paper, a new wavelet-domain codebook design algorithm is proposed for image coding. The method utilizes mean-squared error and variance based selection schemes for good cl...
Momotaz Begum, Nurun Nahar, Kaneez Fatimah, M. K. ...
CSC
2006
13 years 9 months ago
Developing Efficient Option Pricing Algorithms by Combinatorial Techniques
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
Tian-Shyr Dai, Yuh-Dauh Lyuu, Li-min Liu
IPL
2000
95views more  IPL 2000»
13 years 7 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo