2938 search results - page 351 / 588 » On obfuscating point functions |
155
click to vote
ICWE
2009
Springer
16 years 1 months ago
2009
Springer
A corporate portal supports a community of users on cohesively managing a shared set of resources. Such management should also include social tagging, i.e. the practice of collabor...
200
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
![Planar Capacitated Dominating Set Is W[1]-Hard](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Planar Capacitated Dominating Set Is W[1]-Hard")
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
201
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
185
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
172
click to vote
ISECS
2008
IEEE
16 years 29 days ago
2008
IEEE
Buyer-seller watermarking protocols incorporate digital watermarking with cryptography, in order to protect digital copyrights and privacy rights for the seller and the buyer befo...