Sciweavers

16513 search results - page 3258 / 3303
» Numerical Analysis Methods
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
13 years 10 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
CE
2008
102views more  CE 2008»
13 years 10 months ago
E-Science in the classroom - Towards viability
E-Science has the potential to transform school science by enabling learners, teachers and research scientists to engage together in authentic scientific enquiry, collaboration an...
Joshua Underwood, Hilary Smith, Rosemary Luckin, G...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 10 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 10 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
CSR
2008
Springer
13 years 10 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
« Prev « First page 3258 / 3303 Last » Next »