Sciweavers

1099 search results - page 115 / 220
» Factored sequence kernels
Sort
View
COCOON
2003
Springer
15 years 11 months ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
15 years 10 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 9 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
MVA
2002
119views Computer Vision» more  MVA 2002»
15 years 5 months ago
A Cooperative Method of SFM and Stereo for Motion and Depth Extraction
Stereo is a useful technique for obtaining depth information from images. However, it is required that the baseline length between two cameras should be large to increase depth pr...
Jae-Hean Kim, Myung Jin Chung
ICPR
2004
IEEE
16 years 7 months ago
Maximizing Validity in 2D Motion Analysis
Classifying and analyzing human motion from a video is relatively common in many areas. Since the motion is carried out in 3D space, the 2D projection provided by a video is somew...
Martin Eriksson, Stefan Carlsson