980 search results - page 84 / 196 » Faster Possibility Detection by Combining Two Approaches |
156
click to vote
ENTCS
2002
15 years 6 months ago
2002
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
188
click to vote
EMNLP
2007
15 years 7 months ago
2007
We present two machine learning approaches to information extraction from semi-structured documents that can be used if no annotated training data are available, but there does ex...
319
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...
188
click to vote
KBSE
2005
IEEE
15 years 12 months ago
2005
IEEE
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
161
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...