2944 search results - page 103 / 589 » Improving Bound Propagation |
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
APPROX
2008
Springer
14 years 3 days ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
— Cable robots have seen considerable recent interest ensuing from their ability to combine a large workspace with significant payload capacity. However, the cables can apply for...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...