Sciweavers

100 search results - page 5 / 20
» The Callpaper Concept: Turning Paper into Computer Terminals
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 5 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
DAC
1999
ACM
13 years 11 months ago
Distributed Application Development with Inferno
Distributed computing has taken a new importance in order to meet the requirements of users demanding information “anytime, anywhere.” Inferno facilitates the creation and sup...
Ravi Sharma
GD
2008
Springer
13 years 8 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
BIRTHDAY
1991
Springer
13 years 11 months ago
User Interface Development: Problems and Experiences
: In this paper, we present a software engineer's view of user-interface development. First, we illustrate the main problem areas responsible for difficulties in building high...
Hans-Werner Six, Josef Voss
ESA
2003
Springer
141views Algorithms» more  ESA 2003»
14 years 18 days ago
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Nicola Wolpert