Results 1  10
of
26,600
OFFSETTING INVENTORY REPLENISHMENT CYCLES TO MINIMIZE STORAGE SPACE
"... Vicedécanat Recherche et affaires académiques Faculté des sciences de l’administration ..."
Abstract
 Add to MetaCart
Vicedécanat Recherche et affaires académiques Faculté des sciences de l’administration
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 555 (22 self)
 Add to MetaCart
storage space and keep the computational cost of each iteration low. On
Storage management and caching in PAST, a largescale, persistent peertopeer storage utility
, 2001
"... This paper presents and evaluates the storage management and caching in PAST, a largescale peertopeer persistent storage utility. PAST is based on a selforganizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract

Cited by 803 (23 self)
 Add to MetaCart
balances the number of files stored on each node. However, nonuniform storage node capacities and file sizes require more explicit storage load balancing to permit graceful behavior under high global storage utilization; likewise, nonuniform popularity of files requires caching to minimize fetch distance
Freenet: A Distributed Anonymous Information Storage and Retrieval System
 INTERNATIONAL WORKSHOP ON DESIGNING PRIVACY ENHANCING TECHNOLOGIES: DESIGN ISSUES IN ANONYMITY AND UNOBSERVABILITY
, 2001
"... We describe Freenet, an adaptive peertopeer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data ..."
Abstract

Cited by 1064 (12 self)
 Add to MetaCart
We describe Freenet, an adaptive peertopeer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
for the linear transformation defining the constraints, the minimum rank solution can be recovered by solving a convex optimization problem, namely the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 568 (10 self)
 Add to MetaCart
that for large n, and for all Φ’s except a negligible fraction, the following property holds: For every y having a representation y = Φα0 by a coefficient vector α0 ∈ R m with fewer than ρ · n nonzeros, the solution α1 of the ℓ 1 minimization problem min �x�1 subject to Φα = y is unique and equal to α0
Tree visualization with Treemaps: A 2d spacefilling approach
 ACM Transactions on Graphics
, 1991
"... this paper deals with a twodimensional (2d) spacefilling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Research on relationships between 2d images and their representation in tree structures has focussed on node and link representation ..."
Abstract

Cited by 534 (29 self)
 Add to MetaCart
this paper deals with a twodimensional (2d) spacefilling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Research on relationships between 2d images and their representation in tree structures has focussed on node and link
Pastry: Scalable, decentralized object location and routing for largescale peertopeer systems
 IN PROC. OF THE 18TH IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS,
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for widearea peertopeer applications. Pastry performs applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Intern ..."
Abstract

Cited by 1932 (1 self)
 Add to MetaCart
the Internet. It can be used to support a variety of peertopeer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message
The Xtree: An index structure for highdimensional data
 In Proceedings of the Int’l Conference on Very Large Data Bases
, 1996
"... In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures is the over ..."
Abstract

Cited by 592 (17 self)
 Add to MetaCart
In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures
The algorithmic analysis of hybrid systems
 THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract

Cited by 778 (71 self)
 Add to MetaCart
to linear hybrid systems. In particular, we consider symbolic modelchecking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We
Results 1  10
of
26,600