Sciweavers

1261 search results - page 203 / 253
» Approximation algorithms for aligning points
Sort
View
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 10 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
15 years 4 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
AIPS
2009
14 years 10 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
SIAMCO
2010
97views more  SIAMCO 2010»
14 years 4 months ago
Real-Time Nonlinear Optimization as a Generalized Equation
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
Victor M. Zavala, Mihai Anitescu
BMCBI
2006
144views more  BMCBI 2006»
14 years 9 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...