Sciweavers

9888 search results - page 1673 / 1978
» compute 2009
Sort
View
SPIRE
2009
Springer
15 years 11 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
WAIM
2009
Springer
15 years 11 months ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
190
Voted
ACAL
2009
Springer
15 years 10 months ago
An Empirical Exploration of a Definition of Creative Novelty for Generative Art
Abstract. We explore a new definition of creativity -- one which emphasizes the statistical capacity of a system to generate previously unseen patterns -- and discuss motivations f...
Taras Kowaliw, Alan Dorin, Jon McCormack
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
15 years 10 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
AFRIGRAPH
2009
ACM
15 years 10 months ago
Analytic simplification of animated characters
Traditionally, levels of detail (LOD) for animated characters are computed from a single pose. Later techniques refined this approach by considering a set of sample poses and eval...
Bruce Merry, Patrick Marais, James E. Gain
« Prev « First page 1673 / 1978 Last » Next »