Sciweavers

425 search results - page 9 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
CVPR
2007
IEEE
15 years 3 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
EDBT
2009
ACM
96views Database» more  EDBT 2009»
15 years 4 months ago
Top-k dominant web services under multi-criteria matching
As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieva...
Dimitrios Skoutas, Dimitris Sacharidis, Alkis Simi...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 9 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
ITC
2002
IEEE
72views Hardware» more  ITC 2002»
15 years 2 months ago
Test Point Insertion that Facilitates ATPG in Reducing Test Time and Data Volume
Efficient production testing is frequently hampered because current digital circuits require test sets which are too large. These test sets can be reduced significantly by means...
M. J. Geuzebroek, J. Th. van der Linden, A. J. van...
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...