108 search results - page 15 / 22 » On the computational complexity of partial covers of Theta g... |
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
XML is the data interoperability standard in many application domains. Therefore, an increasing number of researchers and professionals, who are not computer scientists (although ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
FOCS
1993
IEEE
13 years 12 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...