4761 search results - page 354 / 953 » Generalizing Boundary Points |
226
Voted
COMPGEOM
2010
ACM
16 years 15 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
176
click to vote
COMPGEOM
2010
ACM
16 years 15 days ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
181
click to vote
MSR
2010
ACM
16 years 15 days ago
2010
ACM
Abstract—In a young field, such as Mining Software Repositories (MSR), there is always a call for benchmarks so that researchers can compare their results against others. Thus i...
195
Voted
DAS
2010
Springer
16 years 7 days ago
2010
Springer
Detecting tables in a spreadsheet is the first step needed to make spreadsheet documents accessible to individuals with visual disabilities. Techniques to enable aural presentati...
183
Voted
ECOOP
2010
Springer
16 years 7 days ago
2010
Springer
Following the scenario-based approach to programming which centered around live sequence charts (LSCs), we propose a general approach to software development in Java. A program wil...