Sciweavers

13987 search results - page 34 / 2798
» The Two Guards Problem
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Two-View Motion Segmentation from Linear Programming Relaxation
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We ...
Hongdong Li
CATS
2006
13 years 9 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
BIOCOMP
2006
13 years 9 months ago
Parameterized Computation of LCS for Two Sequences
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
AAAI
2008
13 years 10 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf
AINA
2008
IEEE
14 years 2 months ago
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
Kai Han, Binoy Ravindran, E. Douglas Jensen