Sciweavers

415 search results - page 23 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
15 years 1 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ACSAC
2001
IEEE
15 years 10 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch
ISLPED
2005
ACM
178views Hardware» more  ISLPED 2005»
15 years 12 months ago
Energy efficient strategies for deployment of a two-level wireless sensor network
We investigate and develop energy-efficient strategies for deployment of wireless sensor networks (WSN) for the purpose of monitoring some phenomenon of interest in a coverage reg...
Ali Iranli, Morteza Maleki, Massoud Pedram
MLG
2007
Springer
16 years 15 days ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola