15033 search results - page 280 / 3007 » Complexity Theory and Algorithms |
126
Voted
SSWMC
2004
15 years 6 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
120
Voted
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
138
Voted
WAIM
2010
Springer
15 years 2 months ago
2010
Springer
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
144
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
148
click to vote
ICNP
2005
IEEE
15 years 10 months ago
2005
IEEE
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...