5055 search results - page 274 / 1011 » Relative Timing |
178
click to vote
DIAGRAMS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Euler diagrams are an effective and intuitive way of representing relationships between sets. As the number of sets represented grows, Euler diagrams can become `cluttere...
196
click to vote
COLING
2010
15 years 2 months ago
2010
We describe a Chinese temporal annotation experiment that produced a sizable data set for the TempEval-2 evaluation campaign. We show that while we have achieved high inter-annota...
188
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
241
click to vote
TCS
2011
15 years 2 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
201
click to vote
RTCSA
2006
IEEE
16 years 1 months ago
2006
IEEE
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...