Sciweavers

584 search results - page 106 / 117
» Using RankBoost to compare retrieval systems
Sort
View
CLUSTER
2011
IEEE
12 years 9 months ago
A Framework for Data-Intensive Computing with Cloud Bursting
—For many organizations, one attractive use of cloud resources can be through what is referred to as cloud bursting or the hybrid cloud. These refer to scenarios where an organiz...
Tekin Bicer, David Chiu, Gagan Agrawal
WWW
2007
ACM
14 years 10 months ago
Globetp: template-based database replication for scalable web applications
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
Tobias Groothuyse, Swaminathan Sivasubramanian, Gu...
CIKM
2004
Springer
14 years 3 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
CIKM
2008
Springer
13 years 11 months ago
Topological analysis of an online social network for older adults
Social network systems on the Internet, such MySpace and LinkedIn, are growing in popularity around the world. The level of such activity is now comparable to that associated with...
Marcella Wilson, Charles K. Nicholas
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 10 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...