Sciweavers

514 search results - page 73 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
ATAL
2009
Springer
14 years 3 months ago
Manipulation and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
14 years 28 days ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
VMV
2000
146views Visualization» more  VMV 2000»
13 years 10 months ago
Matching 3D Freeform Shapes to Digitized Objects
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
Joris S. M. Vergeest, Sander Spanjaard, Jos J. O. ...
IJHPCA
2006
99views more  IJHPCA 2006»
13 years 8 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud