464 search results - page 27 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
191
click to vote
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
146
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
140
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
In the task of adaptive information filtering, a system receives a stream of documents but delivers only those that match a person's information need. As the system filters i...
121
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
112
click to vote
COR
2008
15 years 3 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...