3020 search results - page 221 / 604 » Optimal partition trees |
134
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— In this paper, we propose asynchronous non-orthogonal communication between distributed sensors and a data fusion center via asynchronous direct-sequence code-division ...
222
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
178
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper, we use marked point processes to perform an unsupervised extraction of the coronary tree from 2D X-ray angiography. These processes provide a rigorous framework bas...
185
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
166
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper we shall represent strategic planning problems by dynamic decision trees, in which the nodes are projects that can be deferred or postponed for a certain period of t...