Sciweavers

7839 search results - page 1515 / 1568
» What's News, What's Not
Sort
View
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 8 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen
IJCV
2002
185views more  IJCV 2002»
13 years 8 months ago
Vision and the Atmosphere
Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer ...
Srinivasa G. Narasimhan, Shree K. Nayar
AIM
1999
13 years 8 months ago
JAIR at Five
The Journal of Artificial Intelligence Research (JAIR) was one of the first scientific journals distributed over the Web. It has now completed over five years of successful public...
Steven Minton, Michael P. Wellman
IJON
2002
104views more  IJON 2002»
13 years 8 months ago
Power and the limits of reactive agents
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
Stefano Nolfi
DM
1998
81views more  DM 1998»
13 years 8 months ago
On intersecting hypergraphs
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
Barry Guiduli, Zoltán Király
« Prev « First page 1515 / 1568 Last » Next »