Sciweavers

186 search results - page 31 / 38
» Speeding up algorithms on compressed web graphs
Sort
View
ICPADS
2006
IEEE
14 years 1 months ago
On-line Evolutionary Resource Matching for Job Scheduling in Heterogeneous Grid Environments
In this paper, we describe a resource matcher (RM) developed for the on-line resource matching in heterogeneous grid environments. RM is based on the principles of Evolutionary Al...
Vijay K. Naik, Pawel Garbacki, Krishna Kummamuru, ...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 7 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
CIKM
2005
Springer
14 years 1 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
NETWORKING
2008
13 years 9 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
JCP
2007
118views more  JCP 2007»
13 years 7 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci