787 search results - page 144 / 158 » Polynomial Constants are Decidable |
138
click to vote
MDM
2010
Springer
15 years 9 months ago
2010
Springer
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
135
Voted
CCGRID
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
143
click to vote
ASIACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
138
Voted
PDCN
2004
15 years 5 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
143
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...