Sciweavers

2280 search results - page 386 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
WWW
2007
ACM
16 years 16 days ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
WWW
2004
ACM
16 years 16 days ago
E-learning personalization based on itineraries and long-term navigational behavior
In this paper we describe a practical framework for studying the navigational behavior of the users of an e-learning environment integrated in a virtual campus. The students navig...
Enric Mor, Julià Minguillón
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 15 days ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 8 days ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 5 days ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano