5363 search results - page 929 / 1073 » Building the Cerebellum in a Computer |
178
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
200
click to vote
NIPS
2004
15 years 7 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
169
click to vote
IADIS
2003
15 years 7 months ago
2003
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
181
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
158
click to vote
ISMB
1997
15 years 7 months ago
1997
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...