6251 search results - page 986 / 1251 » Randomness, Computability, and Density |
192
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
163
click to vote
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
182
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Automatic face sketch synthesis has important applications in law enforcement and digital entertainment. Although great progress has been made in recent years, previous methods onl...
205
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
155
click to vote
CRYPTO
1990
Springer
15 years 11 months ago
1990
Springer
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...