Sciweavers

952 search results - page 61 / 191
» Computational complexity of stochastic programming problems
Sort
View
CHI
2005
ACM
16 years 28 days ago
Blind learners programming through audio
The development of programming skills is a motivating issue in computer science. Programming languages have been increasingly used to map end-users needs and mental models. The nu...
Jaime Sánchez, Fernando Aguayo
120
Voted
ICALP
2007
Springer
15 years 6 months 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
JMLR
2006
124views more  JMLR 2006»
15 years 15 days ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
89
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 18 days ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ACL
2009
14 years 10 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty