Sciweavers

2531 search results - page 249 / 507
» Group testing in graphs
Sort
View
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 10 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
ERSA
2010
182views Hardware» more  ERSA 2010»
15 years 4 months ago
Integrating Application Specification and Performance Prediction for Strategic Design-Space Exploration
Abstract--Modeling environments and performance prediction boost application productivity, but often lack integration into an efficient and comprehensive approach to strategic desi...
Brian Holland, Alan D. George, Herman Lam
COMPSAC
2008
IEEE
16 years 1 months ago
Implicit Social Network Model for Predicting and Tracking the Location of Faults
— In software testing and maintenance activities, the observed faults and bugs are reported in bug report managing systems (BRMS) for further analysis and repair. According to th...
Ing-Xiang Chen, Cheng-Zen Yang, Ting-Kun Lu, Hojun...
CIBCB
2007
IEEE
16 years 26 days ago
Evolving Extremal Epidemic Networks
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
Dan Ashlock, Fatemeh Jafargholi
BVAI
2007
Springer
16 years 21 days ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...