Sciweavers

1941 search results - page 247 / 389
» On the Hardness of Approximate Reasoning
Sort
View
JNSM
2010
110views more  JNSM 2010»
15 years 1 months ago
Distributed Automatic Configuration of Complex IPsec-Infrastructures
The Internet Protocol Security Architecture IPsec is hard to deploy in large, nested, or dynamic scenarios. The major reason for this is the need for manual configuration of the cr...
Michael Rossberg, Guenter Schaefer, Thorsten Struf...
PRL
2011
14 years 9 months ago
A Bayes-true data generator for evaluation of supervised and unsupervised learning methods
Benchmarking pattern recognition, machine learning and data mining methods commonly relies on real-world data sets. However, there are some disadvantages in using real-world data....
Janick V. Frasch, Aleksander Lodwich, Faisal Shafa...
ICCV
2011
IEEE
14 years 6 months ago
Realtime Multibody Visual SLAM with a Smoothly Moving Monocular Camera
This paper presents a realtime, incremental multibody visual SLAM system that allows choosing between full 3D reconstruction or simply tracking of the moving objects. Motion recon...
Abhijit Kundu, Madhava Krishna, C. V. Jawahar
ASUNAM
2011
IEEE
14 years 6 months ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...
ATAL
2011
Springer
14 years 6 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr