3946 search results - page 494 / 790 » The computational complexity of choice sets |
154
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
175
click to vote
APVIS
2007
15 years 8 months ago
2007
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
181
click to vote
CCCG
2008
15 years 8 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
134
click to vote
LREC
2008
15 years 8 months ago
2008
The Italian particle ne exhibits interesting anaphoric properties that have not been yet explored in depth from a corpus and computational linguistic perspective. We provide: (i) ...
210
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...