555 search results - page 76 / 111 » Improved results for a memory allocation problem |
PVLDB
2010
14 years 8 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
DASFAA
2003
IEEE
15 years 3 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
IAAI
2003
14 years 11 months ago
2003
This paper reports some results of a long-term work in application of AI techniques whose ultimate goal is the development of tools for resource scheduling. Most of the efforts so...