Sciweavers

2944 search results - page 63 / 589
» Improving Bound Propagation
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
13 years 10 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
ICIP
2002
IEEE
14 years 11 months ago
Fine granularity in multi-loop hybrid coders with multi-layer scalability
The paper describes a generic multi-loop coder structure suitable for mixed spatial and temporal scalability combined with fine granular SNR scalability. The structure is suitable...
Lukasz Blaszak, Marek Domanski, Adam Luczak, Slawo...
CVPR
2010
IEEE
14 years 6 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
CPAIOR
2007
Springer
14 years 4 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
PDP
2005
IEEE
14 years 3 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...