Sciweavers

3020 search results - page 134 / 604
» Optimal partition trees
Sort
View
MCS
2000
Springer
15 years 10 months ago
Classifier Instability and Partitioning
Various methods exist for reducing correlation between classifiers in a multiple classifier framework. The expectation is that the composite classifier will exhibit improved perfor...
Terry Windeatt
TC
1998
15 years 6 months ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem
ALGOSENSORS
2009
Springer
15 years 4 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 8 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
PACT
2009
Springer
15 years 11 months ago
Parallel Evidence Propagation on Multicore Processors
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
Yinglong Xia, Xiaojun Feng, Viktor K. Prasanna