2398 search results - page 244 / 480 » Constraint Programming and Graph Algorithms |
151
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
204
click to vote
FOCS
1998
IEEE
15 years 10 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...
194
click to vote
SGP
2007
15 years 9 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
192
click to vote
VISSYM
2003
15 years 7 months ago
2003
A high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curehavior and construct an abstract representation given by a (topolog...
221
click to vote
SIROCCO
1997
15 years 7 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...