551 search results - page 86 / 111 » The Complexity of Andersen's Analysis in Practice |
CACM
2010
13 years 7 months ago
2010
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
ENTCS
2008
13 years 7 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
IJMMS
2008
13 years 7 months ago
2008
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...