1977 search results - page 132 / 396 » The satisfactory partition problem |
186
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
161
click to vote
EMNLP
2008
15 years 8 months ago
2008
Relationship discovery is the task of identifying salient relationships between named entities in text. We propose novel approaches for two sub-tasks of the problem: identifying t...
136
click to vote
WSC
1997
15 years 7 months ago
1997
In recent articles we presented a general methodology for finite optimization. The new method, the Nested Partitions (NP) method, combines partitioning, random sampling, a select...
151
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
269
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...