Sciweavers

736 search results - page 134 / 148
» Approximating the Number of Network Motifs
Sort
View
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
15 years 11 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
PODS
2005
ACM
211views Database» more  PODS 2005»
15 years 10 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
IMC
2006
ACM
15 years 3 months ago
Fisher information of sampled packets: an application to flow size estimation
Packet sampling is widely used in network monitoring. Sampled packet streams are often used to determine flow-level statistics of network traffic. To date there is conflicting e...
Bruno F. Ribeiro, Donald F. Towsley, Tao Ye, Jean ...
IWANN
2009
Springer
15 years 4 months ago
ZARAMIT: A System for the Evolutionary Study of Human Mitochondrial DNA
Abstract. ZARAMIT is an information system capable of fully automated phylogeny reconstruction. Methods have been tailored to mitochondrial DNA sequences, with focus on subproblem ...
Roberto Blanco, Elvira Mayordomo
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...