1871 search results - page 33 / 375 » The Ephemeral Pairing Problem |
164
click to vote
IJHCI
2008
15 years 6 months ago
2008
Interactive digital television (iDTV) is a social medium and must therefore be tested in a context as close to real life as possible. This explains why we saw the potential and im...
170
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...
208
click to vote
TALG
2008
15 years 6 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
154
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
141
click to vote
ISAAC
2007
Springer
16 years 10 days ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...