1977 search results - page 70 / 396 » The satisfactory partition problem |
163
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
131
click to vote
IJCGA
1998
15 years 5 months ago
1998
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
161
click to vote
UML
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. As the UML attempts to make the transition from a single, albeit extensible, language to a framework for a family of languages, the nature and form of the underlying meta...
166
click to vote
FOCM
2007
15 years 6 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
143
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...