Sciweavers

1951 search results - page 86 / 391
» An algorithm for improving graph partitions
Sort
View
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
16 years 1 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
TCSV
2002
229views more  TCSV 2002»
15 years 3 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
CVPR
2001
IEEE
16 years 6 months ago
Automatic Partitioning of High Dimensional Search Spaces Associated with Articulated Body Motion Capture
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
Jonathan Deutscher, Andrew J. Davison, Ian D. Reid
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
15 years 10 months ago
Two-level microprocessor-accelerator partitioning
The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move softw...
Scott Sirowy, Yonghui Wu, Stefano Lonardi, Frank V...
PCM
2005
Springer
146views Multimedia» more  PCM 2005»
15 years 9 months ago
Sequential Mesh Coding Using Wave Partitioning
Recently, various three-dimensional(3-D) mesh coding schemes have been proposed to improve compression efficiency or error resilience. However, we need to consider both coding effi...
Tae Wan Kim, Kyoung Min, Byeong Choi, Yo-Sung Ho