Sciweavers

310 search results - page 18 / 62
» Why Delannoy numbers
Sort
View
NIPS
2008
13 years 11 months ago
Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning
Randomized neural networks are immortalized in this well-known AI Koan: In the days when Sussman was a novice, Minsky once came to him as he sat hacking at the PDP-6. "What a...
Ali Rahimi, Benjamin Recht
IPPS
1998
IEEE
14 years 2 months ago
A Flexible Class of Parallel Matrix Multiplication Algorithms
This paper explains why parallel implementation of matrix multiplication--a seemingly simple algorithm that can be expressed as one statement and three nested loops--is complex: P...
John A. Gunnels, Calvin Lin, Greg Morrow, Robert A...
SIGCOMM
1997
ACM
14 years 2 months ago
Automated Packet Trace Analysis of TCP Implementations
We describe tcpanaly, a tool for automatically analyzing a TCP implementation's behavior by inspecting packet traces of the TCP's activity. Doing so requires surmounting...
Vern Paxson
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 11 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
SOCO
2010
Springer
13 years 8 months ago
Automatic detection of trends in time-stamped sequences: an evolutionary approach
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
Lourdes Araujo, Juan Julián Merelo Guerv&oa...