23 search results - page 2 / 5 » Combinatorial Interpretation of Kolmogorov Complexity |
APAL
2008
13 years 7 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
ESANN
2007
13 years 9 months ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
EMMCVPR
2001
Springer
14 years 19 hour ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ICESS
2004
Springer
14 years 27 days ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...