1977 search results - page 119 / 396 » The satisfactory partition problem |
180
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
160
click to vote
NIPS
2007
15 years 7 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
178
click to vote
MMS
2002
15 years 6 months ago
2002
Integration--supporting multiple application classes with heterogeneous requirements--is an emerging trend in networks, file systems, and operating systems. In this paper, we eval...
165
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
135
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...