Sciweavers

344 search results - page 45 / 69
» The Directed Minimum Latency Problem
Sort
View
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
ICCV
2005
IEEE
16 years 1 months ago
Quasiconvex Optimization for Robust Geometric Reconstruction
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
Qifa Ke, Takeo Kanade
IPPS
2002
IEEE
15 years 4 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 3 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 1 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska