Sciweavers

5107 search results - page 678 / 1022
» Data Mining and Information Retrieval
Sort
View
200
Voted
SIGCOMM
2010
ACM
15 years 7 months ago
Symbiotic routing in future data centers
Building distributed applications for data centers is hard. CamCube explores whether replacing the traditional switchbased network with a directly connected topology makes it easi...
Hussam Abu-Libdeh, Paolo Costa, Antony I. T. Rowst...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 11 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 8 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
BMCBI
2008
140views more  BMCBI 2008»
15 years 7 months ago
FUNYBASE: a FUNgal phYlogenomic dataBASE
Background: The increasing availability of fungal genome sequences provides large numbers of proteins for evolutionary and phylogenetic analyses. However the heterogeneity of data...
Sylvain Marthey, Gabriela Aguileta, Françoi...
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
16 years 28 days ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin