Sciweavers

157 search results - page 12 / 32
» A reduction of the NF consistency problem
Sort
View
ECAI
2008
Springer
14 years 11 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
NIPS
2001
14 years 11 months ago
Learning Lateral Interactions for Feature Binding and Sensory Segmentation
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
Heiko Wersing
ICDCS
2007
IEEE
15 years 4 months ago
Distributed Density Estimation Using Non-parametric Statistics
Learning the underlying model from distributed data is often useful for many distributed systems. In this paper, we study the problem of learning a non-parametric model from distr...
Yusuo Hu, Hua Chen, Jian-Guang Lou, Jiang Li
AAAI
2010
14 years 11 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 1 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung