Sciweavers

9572 search results - page 106 / 1915
» Cover Algorithms and Their Combination
Sort
View
NAACL
2003
15 years 1 months ago
Unsupervised methods for developing taxonomies by combining syntactic and statistical information
This paper describes an unsupervised algorithm for placing unknown words into a taxonomy and evaluates its accuracy on a large and varied sample of words. The algorithm works by ...
Dominic Widdows
75
Voted
CIKM
2010
Springer
14 years 10 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
ICSE
2003
IEEE-ACM
15 years 12 months ago
Constructing Test Suites for Interaction Testing
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...
ICPR
2002
IEEE
15 years 4 months ago
Combining Shape from Silhouette and Shape from Structured Light for Volume Estimation of Archaeological Vessels
An algorithm for the automatic construction of a 3d model of archaeological vessels using two different 3d algorithms is presented. In archeology the determination of the exact vo...
Robert Sablatnig, Srdan Tosovic, Martin Kampel
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
15 years 1 months ago
Faster Construction of Planar Two-Centers
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
David Eppstein