6251 search results - page 362 / 1251 » Randomness, Computability, and Density |
154
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
111
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
175
click to vote
IEICET
2007
15 years 6 months ago
2007
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
156
Voted
CANDC
2002
ACM
15 years 6 months ago
2002
ACM
In this paper I will outline some of the practical experiences and theoretical concerns that have informed some 15 years of research into the relationship between human creativity...
165
Voted
ICN
2001
Springer
15 years 11 months ago
2001
Springer
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...