Sciweavers

3689 search results - page 662 / 738
» The Branding Analysis Pattern
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 6 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 6 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
IPPS
2009
IEEE
15 years 5 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
COMPLEX
2009
Springer
15 years 5 months ago
Transforming Time Series into Complex Networks
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...
Michael Small, Jie Zhang, Xiaoke Xu
EMSOFT
2009
Springer
15 years 5 months ago
Implementing time-predictable load and store operations
Scratchpads have been widely proposed as an alternative to caches for embedded systems. Advantages of scratchpads include reduced energy consumption in comparison to a cache and a...
Jack Whitham, Neil C. Audsley