288 search results - page 35 / 58 » Notes on computing minimal approximant bases |
QUESTA
2010
13 years 8 months ago
2010
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
CVPR
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
ICDE
2007
IEEE
14 years 4 months ago
2007
IEEE
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
PARA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...