Sciweavers

2634 search results - page 112 / 527
» Faster Than Uppaal
Sort
View
EUROPAR
2003
Springer
14 years 2 months ago
Nswap: A Network Swapping Module for Linux Clusters
Cluster applications that process large amounts of data, such as parallel scientific or multimedia applications, are likely to cause swapping on individual cluster nodes. These ap...
Tia Newhall, Sean Finney, Kuzman Ganchev, Michael ...
CVPR
2004
IEEE
14 years 11 months ago
Optimizing Motion Estimation with Linear Programming and Detail-Preserving Variational Method
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...
Hao Jiang, Ze-Nian Li, Mark S. Drew
CVPR
2005
IEEE
14 years 11 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
CVPR
2007
IEEE
14 years 11 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
CHI
2005
ACM
14 years 9 months ago
Snap-and-go: helping users align objects without the modality of traditional snapping
Snapping is a widely used technique that helps users position graphical objects precisely, e.g., to align them with a grid or other graphical objects. Unfortunately, whenever user...
Patrick Baudisch, Edward Cutrell, Ken Hinckley, Ad...