2957 search results - page 295 / 592 » The Complexity of Polynomial-Time Approximation |
206
click to vote
LATIN
2004
Springer
16 years 14 hour ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
146
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
173
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
Multiple scattering in participating media is generally a complex phenomenon. In the limit of an optically thick medium, i.e., when the mean free path of each photon is much smalle...
207
click to vote
NIPS
2004
15 years 8 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
141
click to vote
DLOG
2009
15 years 7 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...