3874 search results - page 630 / 775 » Approximation Algorithms for k-hurdle Problems |
146
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
174
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
97
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
139
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
125
Voted
PASTE
2004
ACM
15 years 9 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...