Sciweavers

2080 search results - page 346 / 416
» Measuring empirical computational complexity
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
15 years 6 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
IPSN
2011
Springer
14 years 9 months ago
Localising speech, footsteps and other sounds using resource-constrained devices
While a number of acoustic localisation systems have been proposed over the last few decades, these have typically either relied on expensive dedicated microphone arrays and works...
Yukang Guo, Mike Hazas
BMCBI
2008
98views more  BMCBI 2008»
15 years 6 months ago
GBNet: Deciphering regulatory rules in the co-regulated genes using a Gibbs sampler enhanced Bayesian network approach
Background: Combinatorial regulation of transcription factors (TFs) is important in determining the complex gene expression patterns particularly in higher organisms. Deciphering ...
Li Shen, Jie Liu, Wei Wang
PPSN
1990
Springer
15 years 10 months ago
Feature Construction for Back-Propagation
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
Selwyn Piramuthu
DCC
2002
IEEE
16 years 5 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic