8810 search results - page 468 / 1762 » Openness |
131
click to vote
NETWORKS
2007
15 years 6 months ago
2007
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
136
Voted
OL
2007
15 years 6 months ago
2007
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimens...
174
click to vote
EKAW
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we explore the use of location aware mobile devices for searching and browsing a large number of general and cultural heritage information repositories. Based on GPS ...
177
Voted
JGT
2010
15 years 5 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
232
click to vote
PSD
2010
Springer
15 years 5 months ago
2010
Springer
Record linkage has a long tradition in both the statistical and the computer science literature. We survey current approaches to the record linkage problem in a privacy-aware setti...