Sciweavers

14165 search results - page 234 / 2833
» The generalized two-server problem
Sort
View
153
Voted
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
15 years 10 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
150
Voted
NDSS
2003
IEEE
15 years 10 months ago
Traps and Pitfalls: Practical Problems in System Call Interposition Based Security Tools
System call interposition is a powerful method for regulating and monitoring application behavior. In recent years, a wide variety of security tools have been developed that use t...
Tal Garfinkel
ADHOCNOW
2003
Springer
15 years 10 months ago
Topology Control Problems under Symmetric and Asymmetric Power Thresholds
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madha...
129
Voted
CVPR
1999
IEEE
15 years 9 months ago
Efficient Iterative Solution to M-View Projective Reconstruction Problem
We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with ...
Qian Chen, Gérard G. Medioni
160
Voted
ICCV
1998
IEEE
15 years 9 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox