Sciweavers

3946 search results - page 179 / 790
» The computational complexity of choice sets
Sort
View
JMLR
2008
148views more  JMLR 2008»
15 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
SI3D
2010
ACM
16 years 1 months ago
Assisted texture assignment
Virtual environments are typically textured by manually choosing an image to apply on each surface. This implies browsing through large sets of generic textures for each and every...
Matthäus G. Chajdas, Sylvain Lefebvre, Marc S...
PERCOM
2010
ACM
15 years 10 months ago
Decomposing power measurements for mobile devices
—Modern mobile phones are an appealing platform for pervasive computing applications. However, the complexity of these devices makes it difficult for developers to understand th...
Andrew Colin Rice, Simon Hay
ICML
2005
IEEE
16 years 7 months ago
Computational aspects of Bayesian partition models
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
Mikko Koivisto, Kismat Sood
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung