Sciweavers

20638 search results - page 3937 / 4128
» Network Computing
Sort
View
DAM
1998
88views more  DAM 1998»
15 years 2 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
MOC
2002
144views more  MOC 2002»
15 years 2 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng
NECO
2002
145views more  NECO 2002»
15 years 2 months ago
Bayesian Model Assessment and Comparison Using Cross-Validation Predictive Densities
In this work, we discuss practical methods for the assessment, comparison, and selection of complex hierarchical Bayesian models. A natural way to assess the goodness of the model...
Aki Vehtari, Jouko Lampinen
TKDE
1998
77views more  TKDE 1998»
15 years 2 months ago
Techniques for Update Handling in the Enhanced Client-Server DBMS
—The Client-Server computing paradigm has significantly influenced the way modern Database Management Systems are designed and built. In such systems, clients maintain data pages...
Alex Delis, Nick Roussopoulos
152
Voted
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
15 years 2 months ago
Probabilistic scalable P2P resource location services
Scalable resource discovery services form the core of directory and other middleware services. Scalability requirements preclude centralized solutions. The need to have directory ...
Daniel A. Menascé, Lavanya Kanchanapalli
« Prev « First page 3937 / 4128 Last » Next »