Sciweavers

8728 search results - page 346 / 1746
» On Reduct Construction Algorithms
Sort
View
DAGSTUHL
2006
15 years 8 months ago
New Algebraic Tools for Constraint Satisfaction
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
Henning Schnoor, Ilka Schnoor
GLOBECOM
2008
IEEE
15 years 7 months ago
Performance Analysis of Metamaterial Substrate Based MIMO Antenna Arrays
Abstract—A rectangular patch antenna array for MIMO communications was simulated on a magnetic permeability enhanced metamaterial. The performance of this antenna array was studi...
Prathaban Mookiah, Kapil R. Dandekar
ECCV
2008
Springer
16 years 8 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
DAC
2002
ACM
16 years 7 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu