725 search results - page 79 / 145 » Bounding Degrees on RPL |
158
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
149
click to vote
AI
2007
Springer
15 years 5 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
167
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
137
Voted
STACS
2010
Springer
16 years 18 days ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
139
click to vote
ICASSP
2009
IEEE
16 years 10 days ago
2009
IEEE
Recently, it has been shown that it is possible to sample non-bandlimited signals that possess a limited number of degrees of freedom and uniquely reconstruct them from a finite ...