Sciweavers

194 search results - page 36 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 8 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
DEXA
2007
Springer
150views Database» more  DEXA 2007»
14 years 1 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi
FS
2010
148views more  FS 2010»
13 years 6 months ago
Option hedging for small investors under liquidity costs
Following the framework of C¸etin, Jarrow and Protter [4] we study the problem of super-replication in presence of liquidity costs under additional restrictions on the gamma of th...
Umut Çetin, H. Mete Soner, Nizar Touzi
PPOPP
2009
ACM
14 years 8 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
CVPR
2011
IEEE
13 years 2 months ago
Intrinsic Dense 3D Surface Tracking
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
Yun Zeng, Chaohui Wang, Yang Wang, David Gu, Dimit...