395 search results - page 61 / 79 » Positive Versions of Polynomial Time |
JCB
2002
14 years 9 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
ADAEUROPE
2003
Springer
15 years 3 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
160
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...