Sciweavers

1403 search results - page 142 / 281
» Set cover algorithms for very large datasets
Sort
View
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
15 years 8 months ago
Coverage Metrics for Formal Verification
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete ...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
BMCBI
2008
122views more  BMCBI 2008»
15 years 4 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood
COCOON
2010
Springer
15 years 9 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
CVPR
2009
IEEE
16 years 12 months ago
Learning from Ambiguously Labeled Images
In many image and video collections, we have access only to partially labeled data. For example, personal photo collections often contain several faces per image and a caption t...
Benjamin Sapp, Benjamin Taskar, Chris Jordan, Timo...
CVPR
2005
IEEE
16 years 6 months ago
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...
Dragomir Anguelov, Benjamin Taskar, Vassil Chatalb...