575 search results - page 72 / 115 » Computing Maximum Subsequence in Parallel |
PODC
2010
ACM
14 years 20 days ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
ICDCS
2005
IEEE
14 years 2 months ago
2005
IEEE
The process of computing the physical locations of nodes in a wireless sensor network is known as localization. Selflocalization is critical for large-scale sensor networks becaus...
SPAA
2003
ACM
14 years 2 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 ...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...