#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2004

2017

- This year (3)
- Last 5 years (15)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

When we die, we leave imprints of our online lives behind. What should be the fate of these digital footprints after our death? Using a crowdsourced online survey with 400 participants from four countries, we investigate how users want their digital footprint handled after their death, how they would like to communicate these preferences, and whom they… (More)

We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a shortcut connects two vertices and the diameter is measured between vertices, we take all points along the edges of the… (More)

- Jürgen Rehm, Jose Angel Arbesu Prieto, +11 authors Antoni Gual
- BMC family practice
- 2016

BACKGROUND
Even though addressing lifestyle problems is a major recommendation in most guidelines for the treatment of hypertension (HTN), alcohol problems are not routinely addressed in the management of hypertension in primary health care.
METHODS
Internet based survey of 3081 primary care physicians, recruited via the mailing lists of associations for… (More)

- David J Fox, Carsten Grimm, Nicholas P Curzen
- Journal of the Royal Society of Medicine
- 2004

- Prosenjit Bose, Kai Dannies, +5 authors Michiel H. M. Smid
- JoCG
- 2013

Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture… (More)

Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures… (More)

Consider the continuum of points along the edges of a network, an embedded undirected graph with positive edge weights. Distance between these points can be measured as shortest path distance along the edges of the network. We introduce two new concepts to capture farthest-point information in this metric space. The first, eccentricity diagrams, are used to… (More)

6 Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph 7 with positive edge weights. We measure the distance between these points in terms of the weighted 8 shortest path distance, called the network distance. Within this metric space, we study farthest points 9 and farthest distances. We introduce optimal data… (More)

- Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid
- Comput. Geom.
- 2014

Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortest path in S between two points s, t ∈ R, where the distances are measured according to the weighted Euclidean metric—the length of a path is defined to be the weighted sum of… (More)

A large number of businesses that used to be in the centre of Christchurch relocated after the earthquakes. Are they satisfied with their new locations and do they intend to return to the central city? We questioned 209 relocated businesses about their relocation history, present circumstances and future intentions. Many businesses were content with their… (More)