1998 search results - page 219 / 400 » Complexity of the Cover Polynomial |
157
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
158
click to vote
APCSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
189
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
330
click to vote
Book
"Assuming that you want to learn C++, why should you read this book rather than any of dozens of other introductory C++ books? One difference between this book and other intro...
272
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...