Sciweavers

19866 search results - page 203 / 3974
» Computing all factorizations in ***
Sort
View
USITS
2001
15 years 8 months ago
Partial Prefetch for Faster Surfing in Composite Hypermedia
In this paper we present a prefetch technique, which incorporates a scheme similar to data streaming to minimize the response-lag. Unlike previous all or none techniques, we propo...
Javed I. Khan, Qingping Tao
RIAO
2000
15 years 8 months ago
The Effect of Using Hierarchical Classifiers in Text Categorization
Given a set of categories, with or without a preexisting hierarchy among them, we consider the problem of assigning documents to one or more of these categories from the point of ...
Stephen D'Alessio, Keitha A. Murray, Robert Schiaf...
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CLEIEJ
2006
104views more  CLEIEJ 2006»
15 years 6 months ago
A framework for performance evaluation of parallel applications on the GRID
Performance evaluation of applications running on a Grid is a challenging task. Grid's resources are heterogeneous in nature, often shared, and dynamic, all of which have imp...
Carlos Figueira, Emilio Hernández, Eduardo ...
IJISEC
2006
108views more  IJISEC 2006»
15 years 6 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt