Sciweavers

1857 search results - page 68 / 372
» Minimum Degree Orderings
Sort
View
CP
1995
Springer
15 years 3 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run
ICPR
2010
IEEE
15 years 1 days ago
Impact of Vector Ordering Strategies on Morphological Unmixing of Remotely Sensed Hyperspectral Images
Hyperspectral imaging is a new technique in remote sensing that generates hundreds of images, corresponding to different wavelength channels, for the same area on the surface of t...
Antonio Plaza, Javier Plaza
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 1 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
EJC
2010
14 years 12 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
TIT
2010
144views Education» more  TIT 2010»
14 years 6 months ago
Lossy source compression using low-density generator matrix codes: analysis and algorithms
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
Martin J. Wainwright, Elitza N. Maneva, Emin Marti...