12519 search results - page 394 / 2504 » Approximation Problems Categories |
213
click to vote
CBMS
2005
IEEE
16 years 12 days ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
195
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
183
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
165
click to vote
WSCG
2001
15 years 8 months ago
2001
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
180
click to vote
UAI
1998
15 years 8 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...