1816 search results - page 37 / 364 » A New Approach for Solving the Maximum Clique Problem |
AAAI
2006
15 years 1 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
LPAR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
EMNLP
2004
15 years 1 months ago
2004
We perform Noun Phrase Bracketing by using a local, maximum entropy-based tagging model, which produces bracketing hypotheses. These hypotheses are subsequently fed into a reranki...
SIAMCOMP
1998
14 years 11 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
120
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...