Sciweavers

1162 search results - page 103 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
138
Voted
PERCOM
2004
ACM
16 years 3 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
Regina Bischoff, Roger Wattenhofer
MLDM
2005
Springer
15 years 9 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
BMCBI
2008
126views more  BMCBI 2008»
15 years 3 months ago
FCI: an R-based algorithm for evaluating uncertainty of absolute real-time PCR quantification
Background: FCI is an R code for analyzing data from real-time PCR experiments. This algorithm estimates standard curve features as well as nucleic acid concentrations and confide...
Paolo Verderio, Sara Pizzamiglio, Fabio Gallo, Sim...
CLUSTER
2006
IEEE
15 years 3 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
116
Voted
IPPS
2006
IEEE
15 years 9 months ago
Towards an analysis of race carrier conditions in real-time Java
The RTSJ memory model propose a mechanism based on a scope three containing all region-stacks in the system and a reference-counter collector. In order to avoid reference cycles a...
M. Teresa Higuera-Toledano