2588 search results - page 278 / 518 » Applications of Kolmogorov complexity to computable model th... |
175
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
170
click to vote
PE
2007
Springer
15 years 6 months ago
2007
Springer
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
303
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
216
click to vote
MOBICOM
2004
ACM
16 years 3 days ago
2004
ACM
A new modeling framework is introduced for the analytical study of medium access control (MAC) protocols operating in multihop ad hoc networks. The model takes into account the e...
179
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...