2996 search results - page 163 / 600 » Numberings and Randomness |
161
click to vote
JCT
2000
15 years 5 months ago
2000
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
176
click to vote
SLS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
141
click to vote
ASYNC
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
178
click to vote
IJAHUC
2008
15 years 5 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
147
click to vote
ICC
2007
IEEE
15 years 12 months ago
2007
IEEE
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...