2924 search results - page 225 / 585 » Lower Bounds in Distributed Computing |
145
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
129
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
173
click to vote
TCS
2011
14 years 10 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
141
click to vote
FPGA
1999
ACM
15 years 8 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
129
click to vote
CCS
2008
ACM
15 years 5 months ago
2008
ACM
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...