19866 search results - page 171 / 3974 » Computing all factorizations in *** |
137
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
196
click to vote
ACSE
2000
ACM
15 years 11 months ago
2000
ACM
Computer Science Education Research is often done in a very local setting and findings are difficult to transfer to other institutions. There are however several factors that spea...
180
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
268
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
154
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...