Sciweavers

360 search results - page 17 / 72
» Precision-at-ten considered redundant
Sort
View
CLA
2006
13 years 8 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
DFT
2009
IEEE
189views VLSI» more  DFT 2009»
14 years 2 months ago
Analyzing Formal Verification and Testing Efforts of Different Fault Tolerance Mechanisms
Pre-fabrication design verification and post-fabrication chip testing are two important stages in the product realization process. These two stages consume a large part of resourc...
Meng Zhang, Anita Lungu, Daniel J. Sorin
ICPADS
2007
IEEE
14 years 1 months ago
Statistical trust establishment in wireless sensor networks
Abstract— We present a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify malfunctioning and malicious sensor nodes and mini...
Matthew J. Probst, Sneha Kumar Kasera
SECON
2007
IEEE
14 years 1 months ago
A Framework for Resilient Online Coverage in Sensor Networks
—We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor cov...
Ossama Younis, Marwan Krunz, Srinivasan Ramasubram...