Sciweavers

197 search results - page 12 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
CIKM
2009
Springer
14 years 1 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 2 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
ICASSP
2011
IEEE
12 years 11 months ago
Low-rank matrix completion with geometric performance guarantees
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
Wei Dai, Ely Kerman, Olgica Milenkovic
DASFAA
2009
IEEE
89views Database» more  DASFAA 2009»
14 years 2 months ago
FlexBench: A Flexible XML Query Benchmark
Abstract. In this paper we propose a new approach to XML benchmarking – a flexible XML query benchmark called FlexBench. The flexibility is given by two aspects. Firstly, FlexB...
Maros Vranec, Irena Mlýnková