2721 search results - page 389 / 545 » An experimental analysis of Lemke-Howson algorithm |
161
click to vote
SENSYS
2009
ACM
16 years 1 months ago
2009
ACM
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
195
click to vote
IWCIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
208
click to vote
HPDC
2007
IEEE
16 years 24 days ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
160
click to vote
CIVR
2007
Springer
16 years 19 days ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
198
click to vote
SAC
2004
ACM
15 years 12 months ago
2004
ACM
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...