Sciweavers

697 search results - page 52 / 140
» Decomposition Structures for Event-B
Sort
View
AI
2003
Springer
15 years 5 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
ICASSP
2009
IEEE
15 years 6 months ago
Quadtree structured restoration algorithms for piecewise polynomial images
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
Adam Scholefield, Pier Luigi Dragotti
ICDT
1997
ACM
90views Database» more  ICDT 1997»
15 years 4 months ago
Adding Structure to Unstructured Data
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
Peter Buneman, Susan B. Davidson, Mary F. Fernande...
IJCV
2010
186views more  IJCV 2010»
14 years 10 months ago
An Approach to the Parameterization of Structure for Fast Categorization
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...
Christoph Rasche
ML
2010
ACM
181views Machine Learning» more  ML 2010»
14 years 10 months ago
Decomposing the tensor kernel support vector machine for neuroscience data with structured labels
Abstract The tensor kernel has been used across the machine learning literature for a number of purposes and applications, due to its ability to incorporate samples from multiple s...
David R. Hardoon, John Shawe-Taylor