Sciweavers

3208 search results - page 209 / 642
» A Lower Bound for Primality
Sort
View
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
16 years 1 days ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
ATAL
2008
Springer
15 years 8 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
COMCOM
2007
79views more  COMCOM 2007»
15 years 6 months ago
Performance implications of a bounded receive buffer in concurrent multipath transfer
— We study the performance of Concurrent Multipath Transfer using SCTP multihoming (CMT) in the presence of a bounded receive buffer (rbuf). We demonstrate using simulation that ...
Janardhan R. Iyengar, Paul D. Amer, Randall R. Ste...
TSP
2008
69views more  TSP 2008»
15 years 6 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
15 years 6 months ago
New Bounds for Codes Identifying Vertices in Graphs
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
Gérard D. Cohen, Iiro S. Honkala, Antoine L...