1469 search results - page 179 / 294 » Approximate polynomial decomposition |
178
click to vote
JOLLI
2006
15 years 6 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
158
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
172
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
231
click to vote
OL
2011
15 years 1 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
196
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...