Sciweavers

308 search results - page 39 / 62
» How Fast Is the k-Means Method
Sort
View
MHCI
2004
Springer
15 years 8 months ago
Interactive Positioning Based on Object Visibility
Abstract. In this paper we describe a new method and user interface for interactive positioning of a mobile device. The key element of this method is a questionanswer style dialogu...
Christian Kray, Gerd Kortuem
136
Voted
BMCBI
2010
118views more  BMCBI 2010»
15 years 3 months ago
Predicting nucleosome positioning using a duration Hidden Markov Model
Background: The nucleosome is the fundamental packing unit of DNAs in eukaryotic cells. Its detailed positioning on the genome is closely related to chromosome functions. Increasi...
Liqun Xi, Yvonne Fondufe-Mittendorf, Lei Xia, Jare...
120
Voted
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 4 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
107
Voted
CSDA
2007
105views more  CSDA 2007»
15 years 3 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
ICCV
2003
IEEE
15 years 8 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos