Sciweavers

539 search results - page 22 / 108
» Recurrence relations and fast algorithms
Sort
View
115
Voted
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 14 days ago
Join Bayes Nets: A new type of Bayes net for relational data
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
CIARP
2008
Springer
15 years 2 months ago
Measuring the Related Properties of Linearity and Elongation of Point Sets
The concept of elongation is generally well understood. However, there is no clear, precise, mathematical definition of elongation in any dictionary we could find. We propose that ...
Milos Stojmenovic, Amiya Nayak
BMCBI
2010
121views more  BMCBI 2010»
14 years 9 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
103
Voted
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 10 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
JVCA
2006
140views more  JVCA 2006»
15 years 10 days ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni