Sciweavers

5658 search results - page 337 / 1132
» An Efficient Counting Network
Sort
View
232
Voted
MOBIQUITOUS
2007
IEEE
16 years 1 months ago
On Improving Dynamic Source Routing for Intermittently Available Nodes in MANETs
—Previous work on routing in MANETs has resulted in numerous routing protocols that aim at satisfying constraints such as minimum hop or low energy. Existing routing protocols of...
Pramita Mitra, Christian Poellabauer, Shivajit Moh...
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 11 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
206
Voted
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
16 years 6 days ago
Estimating the size of the telephone universe: a Bayesian Mark-recapture approach
Mark-recapture models have for many years been used to estimate the unknown sizes of animal and bird populations. In this article we adapt a finite mixture mark-recapture model i...
David Poole
DSN
2003
IEEE
16 years 4 days ago
The Design of Wearable Systems: A Shift in Development Effort
This paper describes a design process for custom wearable systems produced in an academic setting. A set of 245 wearable design defects from two distinct periods separated by six ...
John G. Dorsey, Daniel P. Siewiorek
ICANN
2009
Springer
15 years 11 months ago
Statistical Instance-Based Ensemble Pruning for Multi-class Problems
Recent research has shown that the provisional count of votes of an ensemble of classifiers can be used to estimate the probability that the final ensemble prediction coincides w...
Gonzalo Martínez-Muñoz, Daniel Hern&...