1722 search results - page 201 / 345 » On the sample mean of graphs |
189
click to vote
HICSS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
186
click to vote
TVCG
2008
15 years 6 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
215
click to vote
LOGCOM
1998
15 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
167
click to vote
TNN
1998
15 years 6 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
166
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...