1647 search results - page 248 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
COCO
2006
Springer
14 years 20 days ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
SIGMETRICS
2002
ACM
13 years 8 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
LATIN
2004
Springer
14 years 2 months ago
2004
Springer
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...