406 search results - page 67 / 82 » Pseudorandomness and Combinatorial Constructions |
100
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
73
Voted
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
107
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
135
click to vote
SMA
2009
ACM
15 years 7 months ago
2009
ACM
We present a robust method to generate mesh surfaces from unoriented noisy points in this paper. The whole procedure consists of three steps. Firstly, the normal vectors at points...
ICPADS
2008
IEEE
15 years 7 months ago
2008
IEEE
The resolution of combinatorial assortments of protein sequences into domains is a prerequisite for protein sequence interpretation. However the recognition and clustering of homo...