Sciweavers

1446 search results - page 129 / 290
» Similarity of Cardinal Directions
Sort
View
ICFP
2003
ACM
16 years 4 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
PERCOM
2007
ACM
16 years 4 months ago
A Wall-Sized Focus Plus Context Display
In this paper we present a wall-sized input system with high accuracy input in the center and lower precision tracking on the remaining parts of the wall. This work complements th...
Sebastian Boring, Otmar Hilliges, Andreas Butz
127
Voted
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 1 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
134
Voted
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
15 years 11 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
156
Voted
BCI
2009
IEEE
15 years 11 months ago
On the Performance of SVD-Based Algorithms for Collaborative Filtering
—In this paper, we describe and compare three Collaborative Filtering (CF) algorithms aiming at the low-rank approximation of the user-item ratings matrix. The algorithm implemen...
Manolis G. Vozalis, Angelos I. Markos, Konstantino...