Sciweavers

32 search results - page 6 / 7
» Stochastic dynamic programming with factored representations
Sort
View
MM
2006
ACM
148views Multimedia» more  MM 2006»
13 years 11 months ago
Audio similarity measure by graph modeling and matching
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to ...
Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Che...
ANOR
2007
73views more  ANOR 2007»
13 years 5 months ago
A sample-path approach to optimal position liquidation
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
Pavlo A. Krokhmal, Stan Uryasev
SOFTVIS
2010
ACM
13 years 5 months ago
Towards anomaly comprehension: using structural compression to navigate profiling call-trees
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
Shen Lin 0003, François Taïani, Thomas...
ALMOB
2006
155views more  ALMOB 2006»
13 years 5 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
CIKM
2005
Springer
13 years 11 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu