1450 search results - page 179 / 290 » On the Complexity of Hardness Amplification |
GRAMMARS
1998
13 years 9 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
JACM
1998
13 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— In recent years, there has been an increasing interest in autonomous navigation for lightweight flying robots. With regard to self-localization flying robots have sev...
KAIS
2010
13 years 8 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...