Sciweavers

2924 search results - page 100 / 585
» Lower Bounds in Distributed Computing
Sort
View
ACL
2012
13 years 3 months ago
A Comprehensive Gold Standard for the Enron Organizational Hierarchy
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
Apoorv Agarwal, Adinoyi Omuya, Aaron Harnly, Owen ...
136
Voted
WIOPT
2010
IEEE
14 years 11 months ago
Throughput-delay-reliability tradeoff in ad hoc networks
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...
Rahul Vaze
109
Voted
ICPR
2010
IEEE
14 years 10 months ago
Variational Mixture of Experts for Classification with Applications to Landmine Detection
Abstract--In this paper, we (1) provide a complete framework for classification using Variational Mixture of Experts (VME); (2) derive the variational lower bound; and (3) apply th...
Seniha Esen Yuksel, Paul D. Gader
ISPDC
2007
IEEE
15 years 6 months ago
Towards Data Partitioning for Parallel Computing on Three Interconnected Clusters
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can...
Brett A. Becker, Alexey L. Lastovetsky