2354 search results - page 369 / 471 » Randomness, Stochasticity and Approximations |
177
click to vote
FAW
2009
Springer
16 years 1 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
177
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
178
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...
164
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...
199
click to vote
IESS
2007
Springer
16 years 1 months ago
2007
Springer
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...