Sciweavers

1211 search results - page 1 / 243
» Topics in 0--1 data
Sort
View
ACTA
2008
136views more  ACTA 2008»
13 years 3 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
ADCM
2008
136views more  ADCM 2008»
13 years 3 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 4 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
ECCC
2010
95views more  ECCC 2010»
13 years 3 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
IJFCS
2006
83views more  IJFCS 2006»
13 years 3 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...