Sciweavers

931 search results - page 157 / 187
» Storage and Querying of E-Commerce Data
Sort
View
JIDM
2010
155views more  JIDM 2010»
13 years 7 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 3 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
WWW
2007
ACM
14 years 9 months ago
Consistency-preserving caching of dynamic database content
With the growing use of dynamic web content generated from relational databases, traditional caching solutions for throughput and latency improvements are ineffective. We describe...
Niraj Tolia, M. Satyanarayanan
CHI
2005
ACM
14 years 9 months ago
Automating the detection of breaks in continuous user experience with computer games
This paper describes an approach towards automating the identification of design problems with three-dimensional mediated or gaming environments through the capture and query of u...
Tim Marsh, Kiyoung Yang, Cyrus Shahabi, Wee Ling W...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan