644 search results - page 112 / 129 » Decomposition Complexity |
107
click to vote
AICCSA
2008
IEEE
15 years 4 months ago
2008
IEEE
During the last decades, performance of available hardware resources constantly increased [15], which enabled the assignment of more and more complex tasks to software systems. As...
MICRO
2007
IEEE
15 years 4 months ago
2007
IEEE
Program runtime characteristics exhibit significant variation. As microprocessor architectures become more complex, their efficiency depends on the capability of adapting with wor...
101
click to vote
WADS
2007
Springer
15 years 4 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
132
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
90
Voted
ACISICIS
2008
IEEE
15 years 5 days ago
2008
IEEE
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...