13306 search results - page 406 / 2662 » Theoretical Computer Science |
163
click to vote
ACMSE
2006
ACM
16 years 25 days ago
2006
ACM
In this paper, we propose several methods to increase the difficulty of reverse engineering applications, with special emphasis on preventing the circumvention of copy protection ...
174
click to vote
ACMSE
2006
ACM
16 years 25 days 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...
136
click to vote
FOCS
2005
IEEE
16 years 14 days 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...
193
click to vote
FOCS
2005
IEEE
16 years 14 days 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...
147
click to vote
FOCS
2005
IEEE
16 years 14 days ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...