10271 search results - page 648 / 2055 » Computer Science |
187
click to vote
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
Reconstructing networks from time series data is a difficult inverse problem. We apply two methods to this problem using co-temporal functions. Co-temporal functions capture mathe...
207
Voted
ACSC
2005
IEEE
16 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
151
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
218
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
178
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 ...