Sciweavers

2520 search results - page 49 / 504
» The complexity of approximating entropy
Sort
View
ICIP
1998
IEEE
15 years 11 months ago
Simultaneous Optimal Boundary Encoding and Variable-Length Code Selection
This paper describes e cient and optimal encoding and representation of object contours. Contours are approximated by connected second-order spline segments, each de ned by three ...
Gerry Melnikov, Guido M. Schuster, Aggelos K. Kats...
AI
1998
Springer
14 years 9 months ago
Uncertainty Measures of Rough Set Prediction
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
Ivo Düntsch, Günther Gediga
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
15 years 1 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
SIAMSC
2008
136views more  SIAMSC 2008»
14 years 10 months ago
On the Time Splitting Spectral Method for the Complex Ginzburg-Landau Equation in the Large Time and Space Scale Limit
We are interested in the numerical approximation of the complex Ginzburg
Pierre Degond, Shi Jin, Min Tang
ENTCS
2007
98views more  ENTCS 2007»
14 years 10 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...