Sciweavers

5463 search results - page 870 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
ICNSC
2007
IEEE
16 years 1 months ago
Analysis of a Simple Feedback Scheme for Error Correction over a Lossy Network
Abstract— In time varying packet-switched networks, delivering data with high reliability using a limited amount of network resources is highly desirable. To capture the trade-of...
Oscar Flardh, Carlo Fischione, Karl Henrik Johanss...
IPPS
2006
IEEE
16 years 1 months ago
Neighbourhood maps: decentralised ranking in small-world P2P networks
Reputation in P2P networks is an important tool to encourage cooperation among peers. It is based on ranking of peers according to their past behaviour. In large-scale real world ...
Matteo Dell'Amico
IPPS
2003
IEEE
16 years 15 days ago
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
Andreas Krause, Markus Kräutner, Harald Meier
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 12 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
15 years 10 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher