1525 search results - page 156 / 305 » Matching with Regular Constraints |
198
Voted
EMNLP
2011
14 years 6 months ago
2011
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
183
Voted
SMI
2005
IEEE
16 years 16 days ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
193
click to vote
UML
2004
Springer
16 years 9 days ago
2004
Springer
Being part of domain engineering, domain analysis enables identifying domains and capturing their ontologies in order to assist and guide system developers to design domain-specifi...
171
Voted
AAAI
2007
15 years 9 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
183
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper is concerned with cellular systems with rate constraints in fading environments. We consider a simple but asymptotically optimal matched filtering/successive interfer...