Sciweavers

186 search results - page 11 / 38
» Speeding up algorithms on compressed web graphs
Sort
View
TIP
2002
116views more  TIP 2002»
13 years 7 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
14 years 5 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
HT
2006
ACM
14 years 1 months ago
Journey to the past: proposal of a framework for past web browser
While the Internet community recognized early on the need to store and preserve past content of the Web for future use, the tools developed so far for retrieving information from ...
Adam Jatowt, Yukiko Kawai, Satoshi Nakamura, Yutak...
VIS
2003
IEEE
116views Visualization» more  VIS 2003»
14 years 8 months ago
Space Efficient Fast Isosurface Extraction for Large Datasets
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
Udeepta Bordoloi, Han-Wei Shen