Sciweavers

1220 search results - page 87 / 244
» Restricting grammatical complexity
Sort
View
IANDC
1998
64views more  IANDC 1998»
13 years 7 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 7 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
GIS
2010
ACM
13 years 6 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
PVLDB
2010
125views more  PVLDB 2010»
13 years 6 months ago
The Impact of Virtual Views on Containment
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and an...
Michael Benedikt, Georg Gottlob
ICC
2009
IEEE
113views Communications» more  ICC 2009»
13 years 5 months ago
Using GMM and SVM-Based Techniques for the Classification of SSH-Encrypted Traffic
When employing cryptographic tunnels such as the ones provided by Secure Shell (SSH) to protect their privacy on the Internet, users expect two forms of protection. First, they aim...
Maurizio Dusi, Alice Este, Francesco Gringoli, Luc...