Sciweavers

1871 search results - page 33 / 375
» The Ephemeral Pairing Problem
Sort
View
IJHCI
2008
92views more  IJHCI 2008»
14 years 11 months ago
Coupling the Users: The Benefits of Paired User Testing for iDTV
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...
Tara Shrimpton-Smith, Bieke Zaman, David Geerts
TACAS
2010
Springer
241views Algorithms» more  TACAS 2010»
15 years 6 months ago
Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions
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 ...
Matthieu Moy, Karine Altisen
TALG
2008
131views more  TALG 2008»
14 years 11 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
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...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
71
Voted
SIAMDM
2008
100views more  SIAMDM 2008»
14 years 11 months ago
Tree-Related Widths of Graphs and Hypergraphs
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] ...
Isolde Adler
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
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...
Jiong Guo