Sciweavers

17 search results - page 3 / 4
» A Faster Algorithm for Finding Minimum Tucker Submatrices
Sort
View
AIPS
2004
13 years 7 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
ICIP
1998
IEEE
14 years 7 months ago
Adaptive Search Center Non-Linear Three Step Search
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It d...
Hing Y. Chung, Paul Y. S. Cheung, N. H. C. Yung
EMMCVPR
2007
Springer
13 years 10 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
ICALP
2009
Springer
14 years 6 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
COMAD
2009
13 years 7 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey