Sciweavers

191 search results - page 11 / 39
» Sample Selection for Maximal Diversity
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
NC node selection game in collaborative streaming systems
Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distribute...
Nikolaos Thomos, Hyunggon Park, Eymen Kurdoglu, Pa...
SECON
2010
IEEE
13 years 5 months ago
Distributed Routing, Relay Selection, and Spectrum Allocation in Cognitive and Cooperative Ad Hoc Networks
Throughput maximization is a key challenge in cognitive radio ad hoc networks, where the availability of local spectrum resources may change from time to time and hopby-hop. To ach...
Lei Ding, Tommaso Melodia, Stella N. Batalama, Joh...
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
Blast sampling for structural and functional analyses
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
Anne Friedrich, Raymond Ripp, Nicolas Garnier, Emm...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
ICDAR
2003
IEEE
14 years 1 months ago
Automatic Feature Selection with Applications to Script Identification of Degraded Documents
Current approaches to script identification rely on hand-selected features and often require processing a significant part of the document to achieve reliable identification. We p...
Vitaly Ablavsky, Mark R. Stevens