Sciweavers

4860 search results - page 396 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
106
Voted
WSC
2007
15 years 6 months ago
Transformations for accelerating MCMC simulations with broken ergodicity
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
Mark Fleischer
111
Voted
ECAI
2008
Springer
15 years 5 months ago
A Formal Approach for RDF/S Ontology Evolution
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
George Konstantinidis, Giorgos Flouris, Grigoris A...
151
Voted
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 4 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
142
Voted
KES
2006
Springer
15 years 3 months ago
Sensor Network Localization Using Least Squares Kernel Regression
Abstract. This paper considers the sensor network localization problem using signal strength. Unlike range-based methods signal strength information is stored in a kernel matrix. L...
Anthony Kuh, Chaopin Zhu, Danilo P. Mandic
123
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao