Sciweavers

454 search results - page 84 / 91
» Distance Education at a Glance
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
14 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 9 months ago
Separations of Matroid Freeness Properties
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
Arnab Bhattacharyya, Elena Grigorescu, Jakob Nords...
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CORR
2008
Springer
152views Education» more  CORR 2008»
14 years 9 months ago
Characterizing User Mobility in Second Life
In this work we present a measurement study of user mobility in Second Life. We first discuss different techniques to collect user traces and then focus on results obtained using ...
Chi-Anh La, Pietro Michiardi
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 9 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz