Sciweavers

176 search results - page 29 / 36
» Topics in the theory of DNA computing
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
14 years 7 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
ISI
2008
Springer
14 years 8 months ago
Intelligent pattern recognition and biometrics
This talk deals with advanced concepts of Artificial Intelligence (AI) and Pattern Recognition (PR), and their applications to solving real life problems including biometrics appl...
P. Wang
WWW
2003
ACM
15 years 10 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...
PODS
2003
ACM
135views Database» more  PODS 2003»
15 years 9 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
INFOCOM
2009
IEEE
15 years 4 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu