Sciweavers

3663 search results - page 173 / 733
» Problems in the ontology of computer programs
Sort
View
AIR
2004
143views more  AIR 2004»
15 years 6 months ago
Hebrew Computational Linguistics: Past and Future
This paper reviews the current state of the art in Natural Language Processing for Hebrew, both theoretical and practical. The Hebrew language, like other Semitic languages, poses...
Shuly Wintner
CONSTRAINTS
2011
15 years 1 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
FOCS
2005
IEEE
16 years 4 days ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
BMCBI
2011
15 years 1 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...
ICALP
2007
Springer
16 years 20 days ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson