Sciweavers

761 search results - page 40 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
13 years 9 months ago
An exact subexponential-time lattice algorithm for Asian options
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
Tian-Shyr Dai, Yuh-Dauh Lyuu
EDBT
2009
ACM
92views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang
ICML
2009
IEEE
14 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
JMLR
2006
97views more  JMLR 2006»
13 years 7 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke
ACSAC
2001
IEEE
13 years 11 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch