Sciweavers

377 search results - page 27 / 76
» Accelerating Large Data Analysis by Exploiting Regularities
Sort
View
TACAS
2010
Springer
210views Algorithms» more  TACAS 2010»
15 years 6 months ago
Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
Alastair F. Donaldson, Daniel Kroening, Philipp R&...
WWW
2008
ACM
16 years 11 days ago
Computable social patterns from sparse sensor data
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
Dinh Q. Phung, Brett Adams, Svetha Venkatesh
ADHOCNETS
2009
Springer
15 years 6 months ago
Optimal Cluster Sizes for Wireless Sensor Networks: An Experimental Analysis
Node clustering and data aggregation are popular techniques to reduce energy consumption in large WSNs and a large body of literature has emerged describing various clustering prot...
Anna Förster, Alexander Förster, Amy L. ...
DKE
2008
79views more  DKE 2008»
14 years 11 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
JGAA
2007
135views more  JGAA 2007»
14 years 11 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento