Sciweavers

83 search results - page 7 / 17
» Solving Coverage Problems with Embedded Graph Grammars
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Object Detection and Segmentation from Joint Embedding of Parts and Pixels
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
Michael Maire, Stella X. Yu, Pietro Perona
NIPS
2007
13 years 8 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
ATS
2000
IEEE
98views Hardware» more  ATS 2000»
13 years 11 months ago
Embedded core testing using genetic algorithms
Testing of embedded cores is very difficult in SOC (system-on-a-chip), since the core user may not know the gate level implementation of the core, and the controllability and obse...
Ruofan Xu, Michael S. Hsiao
NLP
2000
13 years 10 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
JNSM
2008
93views more  JNSM 2008»
13 years 7 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia