Sciweavers

4886 search results - page 747 / 978
» Approximate Data Exchange
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 4 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
ALMOB
2006
138views more  ALMOB 2006»
15 years 4 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
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
CGF
2010
182views more  CGF 2010»
15 years 2 months ago
A Data-driven Segmentation for the Shoulder Complex
The human shoulder complex is perhaps the most complicated joint in the human body being comprised of a set of three bones, muscles, tendons, and ligaments. Despite this anatomica...
Q. Youn Hong, Sang Il Park, Jessica K. Hodgins
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 11 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma