4843 search results - page 262 / 969 » The Shortcut Problem - Complexity and Approximation |
153
Voted
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
155
Voted
CBMS
2005
IEEE
15 years 9 months 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...
141
Voted
STOC
1998
ACM
15 years 8 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...
123
Voted
ECML
2006
Springer
15 years 7 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...
129
click to vote
WSCG
2001
15 years 5 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...