Sciweavers

87 search results - page 9 / 18
» Using hashing to solve the dictionary problem
Sort
View
AINA
2004
IEEE
13 years 11 months ago
Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chin-Chen Chang, Chu-Hsing Lin, Wei Lee, Pai-Cheng...
AICT
2006
IEEE
102views Communications» more  AICT 2006»
13 years 9 months ago
Publishing, Retrieving and Streaming Lectures via Application Level Multicast
Structured peer-to-peer overlay network is an efficient solution for querying and retrieving resources spread between the peers. Unfortunately, key based routing of Distributed Ha...
Marco Milanesio, Giancarlo Ruffo
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 2 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
TON
2010
138views more  TON 2010»
13 years 2 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 2 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers