9736 search results - page 57 / 1948 » How Fast Can We Compute Products |
179
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
131
click to vote
KI
2008
Springer
15 years 4 months ago
2008
Springer
Requirements engineering is a central part of software projects. It is assumed that two third of all errors in software projects are caused by forgotten requirements or mutual misu...
117
Voted
DAC
2009
ACM
15 years 11 months ago
2009
ACM
The latest advancements in the commercial formal model checkers have enabled the integration of formal property verification with the conventional testbench based methods in the o...
148
click to vote
JMLR
2006
15 years 4 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
165
Voted
TC
2002
15 years 4 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...