Sciweavers

4903 search results - page 135 / 981
» The Set Covering Machine
Sort
View
TALG
2008
93views more  TALG 2008»
13 years 9 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
COMBINATORICA
2010
13 years 6 months ago
A superadditivity and submultiplicativity property for cardinalities of sumsets
For finite sets of integers A1, A2 . . . An we study the cardinality of the n-fold sumset A1 +
Katalin Gyarmati, Máté Matolcsi, Imr...
SP
2010
IEEE
187views Security Privacy» more  SP 2010»
14 years 1 months ago
Outside the Closed World: On Using Machine Learning for Network Intrusion Detection
Abstract—In network intrusion detection research, one popular strategy for finding attacks is monitoring a network’s activity for anomalies: deviations from profiles of norma...
Robin Sommer, Vern Paxson
FSS
2008
127views more  FSS 2008»
13 years 9 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
13 years 6 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro