Sciweavers

16188 search results - page 11 / 3238
» The Optimal PAC Algorithm
Sort
View
PE
2010
Springer
119views Optimization» more  PE 2010»
13 years 5 months ago
A discrete-time Markov-modulated queuing system with batched arrivals
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to t...
Richard G. Clegg
INFOCOM
2012
IEEE
11 years 10 months ago
FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
Chad R. Meiners, Eric Norige, Alex X. Liu, Eric To...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ATAL
2008
Springer
13 years 9 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
PRL
2007
150views more  PRL 2007»
13 years 7 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan