543 search results - page 78 / 109 » New Upper Bounds for MaxSat |
155
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
HM
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
86
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...