Sciweavers

6365 search results - page 1187 / 1273
» Fast Local Computation Algorithms
Sort
View
126
Voted
SIGCOMM
2006
ACM
15 years 8 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ECML
2005
Springer
15 years 8 months ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
ICIAR
2005
Springer
15 years 8 months ago
Real-Time and Robust Background Updating for Video Surveillance and Monitoring
Abstract. Background updating is an important aspect of dynamic scene analysis. Two critical problems: sudden camera perturbation and the sleeping person problem, which arise frequ...
Xingzhi Luo, Suchendra M. Bhandarkar
IMC
2004
ACM
15 years 8 months ago
On scalable attack detection in the network
Current intrusion detection and prevention systems seek to detect a wide class of network intrusions (e.g., DoS attacks, worms, port scans) at network vantage points. Unfortunatel...
Ramana Rao Kompella, Sumeet Singh, George Varghese
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 7 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
« Prev « First page 1187 / 1273 Last » Next »