Sciweavers

3958 search results - page 555 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
VTS
2006
IEEE
93views Hardware» more  VTS 2006»
16 years 16 days ago
Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
Vishwani D. Agrawal, Soumitra Bose, Vijay Gangaram
PAM
2004
Springer
15 years 12 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
KDD
1997
ACM
161views Data Mining» more  KDD 1997»
15 years 10 months ago
Automated Discovery of Active Motifs in Three Dimensional Molecules
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
Xiong Wang, Jason Tsong-Li Wang, Dennis Shasha, Br...
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 8 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
MLMTA
2007
15 years 8 months ago
Consensus Based Ensembles of Soft Clusterings
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
Kunal Punera, Joydeep Ghosh