Sciweavers

700 search results - page 79 / 140
» et 2008
Sort
View
NSDI
2008
13 years 10 months ago
Centered Discretization with Application to Graphical Passwords
Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of B...
Sonia Chiasson, Jayakumar Srinivasan, Robert Biddl...
COCOON
2008
Springer
13 years 9 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
SDM
2008
SIAM
121views Data Mining» more  SDM 2008»
13 years 9 months ago
Integration of Multiple Networks for Robust Label Propagation
Transductive inference on graphs such as label propagation algorithms is receiving a lot of attention. In this paper, we address a label propagation problem on multiple networks a...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 9 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
13 years 9 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber