Sciweavers

834 search results - page 101 / 167
» A Decomposition Technique for Max-CSP
Sort
View
JMIV
2006
161views more  JMIV 2006»
13 years 10 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
ENTCS
2007
116views more  ENTCS 2007»
13 years 10 months ago
DisCComp - A Formal Model for Distributed Concurrent Components
Most large-scaled software systems are structured in distributed components to manage complexity and have to cope with concurrent executed threads. System decomposition and concur...
Andreas Rausch
MICS
2008
72views more  MICS 2008»
13 years 10 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
PR
2006
132views more  PR 2006»
13 years 10 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
TKDE
2008
123views more  TKDE 2008»
13 years 10 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko