Sciweavers

2365 search results - page 88 / 473
» All things are connected
Sort
View
TIT
1998
73views more  TIT 1998»
15 years 1 months ago
Subspace Subcodes of Reed-Solomon Codes
— In this paper we introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed–Solomon (SSRS) codes. An SSRS code is a subset of a par...
Masayuki Hattori, Robert J. McEliece, Gustave Solo...
SIGIR
2002
ACM
15 years 1 months ago
Collaborative filtering with privacy via factor analysis
Collaborative filtering (CF) is valuable in e-commerce, and for direct recommendations for music, movies, news etc. But today's systems have several disadvantages, including ...
John F. Canny
GI
2009
Springer
14 years 11 months ago
Spontaneous and Privacy-friendly Mobile Indoor Routing and Navigation
Abstract: Mobile indoor navigation systems guide users through buildings and premises by taking into account the current position of the user and a destination such as a room, offi...
Peter Ruppel, Florian Gschwandtner
COMPGEOM
1992
ACM
15 years 5 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
143
Voted
ICALP
2003
Springer
15 years 6 months ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang