Sciweavers

1633 search results - page 286 / 327
» Data Storage Requirements for the Service Oriented Computing
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 4 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
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 3 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ISCA
2009
IEEE
146views Hardware» more  ISCA 2009»
15 years 4 months ago
Multi-execution: multicore caching for data-similar executions
While microprocessor designers turn to multicore architectures to sustain performance expectations, the dramatic increase in parallelism of such architectures will put substantial...
Susmit Biswas, Diana Franklin, Alan Savage, Ryan D...
MM
2005
ACM
146views Multimedia» more  MM 2005»
15 years 3 months ago
Unsupervised content discovery in composite audio
Automatically extracting semantic content from audio streams can be helpful in many multimedia applications. Motivated by the known limitations of traditional supervised approache...
Rui Cai, Lie Lu, Alan Hanjalic
SAC
2006
ACM
15 years 4 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi