5153 search results - page 430 / 1031 » Introduction to Randomized Algorithms |
157
Voted
COLOGNETWENTE
2009
15 years 6 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
136
click to vote
CVIU
2006
15 years 5 months ago
2006
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
121
click to vote
JCM
2007
15 years 5 months ago
2007
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...
138
click to vote
JCT
2007
15 years 5 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
131
click to vote
TCS
1998
15 years 4 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...