Sciweavers

262 search results - page 34 / 53
» Approximating the 2-Interval Pattern Problem
Sort
View
MLG
2007
Springer
14 years 4 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
ECCV
2002
Springer
14 years 11 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
14 years 10 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...
CP
2010
Springer
13 years 7 months ago
An Empirical Study of Optimization for Maximizing Diffusion in Networks
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
Kiyan Ahmadizadeh, Bistra N. Dilkina, Carla P. Gom...
ALMOB
2006
138views more  ALMOB 2006»
13 years 10 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh