2165 search results - page 109 / 433 » cases 2005 |
121
click to vote
ACSD
2005
IEEE
15 years 9 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
134
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
113
Voted
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. There are several computer programs that align mRNA with its genomic counterpart to determine exon boundaries. Though most of these programs perform such alignment effici...
116
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a novel method for visually monitoring a highway when the camera is relatively low to the ground and on the side of the road. In such a case, occlusion and the perspect...
136
Voted
WINE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...