674 search results - page 75 / 135 » The computational complexity of the parallel knock-out probl... |
112
click to vote
IEEEPACT
2007
IEEE
15 years 7 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
111
click to vote
ECOOPW
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Coordination and Adaptation are two key issues when developing complex distributed systems. Coordination focuses on the interaction among computational entities. Adaptati...
107
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
146
click to vote
APVIS
2010
14 years 8 months ago
2010
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...