4679 search results - page 497 / 936 » Modeling When Connections Are the Problem |
159
click to vote
ACL
2006
15 years 8 months ago
2006
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
203
click to vote
AAAI
2000
15 years 8 months ago
2000
We present a new domain for unsupervised learning: automatically customizing the computer to a specific melodic performer by merely listening to them improvise. We also describe B...
163
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
198
click to vote
EOR
2007
15 years 6 months ago
2007
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
176
click to vote
TOG
2008
15 years 6 months ago
2008
This paper addresses the long-standing problem of the unavoidable gaps that arise when expressing the intersection of two NURBS surfaces using conventional trimmed-NURBS represent...