Sciweavers

3837 search results - page 726 / 768
» Learning Approximate Consistencies
Sort
View
MEDIAFORENSICS
2010
14 years 10 months ago
Biometric template transformation: a security analysis
One of the critical steps in designing a secure biometric system is protecting the templates of the users that are stored either in a central database or on smart cards. If a biom...
Abhishek Nagar, Karthik Nandakumar, Anil K. Jain
SAT
2010
Springer
172views Hardware» more  SAT 2010»
14 years 10 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SIAMCO
2010
116views more  SIAMCO 2010»
14 years 10 months ago
Large-Population LQG Games Involving a Major Player: The Nash Certainty Equivalence Principle
We consider linear-quadratic-Gaussian (LQG) games with a major player and a large number of minor players. The major player has a significant influence on others. The minor playe...
Minyi Huang
SIAMDM
2010
149views more  SIAMDM 2010»
14 years 10 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
GLOBECOM
2010
IEEE
14 years 9 months ago
Trust Management for Encounter-Based Routing in Delay Tolerant Networks
: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation...
Ing-Ray Chen, Fenye Bao, Moonjeong Chang, Jin-Hee ...