Sciweavers

2496 search results - page 261 / 500
» On covering by translates of a set
Sort
View
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
16 years 4 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 3 months ago
Exploring linear structures of critical path delay faults to reduce test efforts
It has been shown that the delay of a target path can be composed linearly of other path delays. If the later paths are robustly testable (with known delay values), the target pat...
Shun-Yen Lu, Pei-Ying Hsieh, Jing-Jia Liou
WCRE
2008
IEEE
16 years 1 months ago
Retrieving Task-Related Clusters from Change History
During software maintenance tasks, developers often spend an important amount of effort investigating source code. This effort can be reduced if tools are available to help develo...
Martin P. Robillard, Barthélémy Dage...
DASFAA
2005
IEEE
171views Database» more  DASFAA 2005»
16 years 8 days ago
Mining Succinct Systems of Minimal Generators of Formal Concepts
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li, Li...
CIARP
2005
Springer
16 years 6 days ago
Dynamic Hierarchical Compact Clustering Algorithm
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
Reynaldo Gil-García, José Manuel Bad...