Sciweavers

3702 search results - page 633 / 741
» All Pairings Are in a Group
Sort
View
IJON
2007
80views more  IJON 2007»
15 years 6 months ago
To each his own: The caregiver's role in a computational model of gaze following
We investigate a computational model of the emergence of gaze following that is based on a generic basic set of mechanisms. Whereas much attention has been focused so far on the s...
Christof Teuscher, Jochen Triesch
TASLP
2008
176views more  TASLP 2008»
15 years 6 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
TCBB
2008
93views more  TCBB 2008»
15 years 6 months ago
2SNP: Scalable Phasing Method for Trios and Unrelated Individuals
Emerging microarray technologies allow affordable typing of very long genome sequences. A key challenge in analyzing of such huge amount of data is scalable and accurate computatio...
Dumitru Brinza, Alexander Zelikovsky
TCS
2008
15 years 6 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
IPM
2007
105views more  IPM 2007»
15 years 6 months ago
Schema and constraints-based matching and merging of Topic Maps
In this paper, we propose a multi-strategic matching and merging approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constr...
Jung-Min Kim, Hyopil Shin, Hyoung-Joo Kim