Sciweavers

451 search results - page 45 / 91
» On Parameterized Exponential Time Complexity
Sort
View
AOSD
2008
ACM
13 years 12 months ago
Expressive scoping of dynamically-deployed aspects
Several aspect languages and frameworks have recognized the need for dynamic deployment of aspects. However, they do not provide sufficiently expressive means to precisely specify...
Éric Tanter
PRICAI
2004
Springer
14 years 3 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
14 years 1 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
ICML
2000
IEEE
14 years 10 months ago
Complete Cross-Validation for Nearest Neighbor Classifiers
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
Matthew D. Mullin, Rahul Sukthankar
PE
2002
Springer
128views Optimization» more  PE 2002»
13 years 9 months ago
Response times in a two-node queueing network with feedback
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...
Robert D. van der Mei, Bart Gijsen, N. in't Veld, ...