Sciweavers

1731 search results - page 295 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
BMCBI
2010
155views more  BMCBI 2010»
13 years 8 months ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
IJON
2008
101views more  IJON 2008»
13 years 7 months ago
Learning dynamics and robustness of vector quantization and neural gas
Various alternatives have been developed to improve the Winner-Takes-All (WTA) mechanism in vector quantization, including the Neural Gas (NG). However, the behavior of these algo...
Aree Witoelar, Michael Biehl, Anarta Ghosh, Barbar...
AAAI
2011
12 years 7 months ago
Relational Blocking for Causal Discovery
Blocking is a technique commonly used in manual statistical analysis to account for confounding variables. However, blocking is not currently used in automated learning algorithms...
Matthew J. Rattigan, Marc E. Maier, David Jensen