Sciweavers

15317 search results - page 2787 / 3064
» Globally Distributed Data
Sort
View
JCST
2006
65views more  JCST 2006»
15 years 6 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
JUCS
2008
116views more  JUCS 2008»
15 years 6 months ago
Comparative Aspects between the Cluster and Grid Implementations of BigBatch
: BigBatch is an image processing environment designed to process batches of thousands of monochromatic documents. One of the flexibilities and pioneer aspects of BigBatch is offer...
Giorgia de Oliveira Mattos, Andrei de Araúj...
DSS
2007
76views more  DSS 2007»
15 years 6 months ago
Deadline-based escalation in process-aware information systems
Process-aware information systems are typically driven by process models capturing an idealized view of the actual processes. For example, most process models assume that planned ...
Wil M. P. van der Aalst, Michael Rosemann, Marlon ...
ECRA
2007
116views more  ECRA 2007»
15 years 6 months ago
Two-level workload characterization of online auctions
Online auctions are rapidly becoming one of the significant forms of electronic commerce for buying and selling goods and services. A good understanding of the workload of auctio...
Vasudeva Akula, Daniel A. Menascé
JMLR
2006
118views more  JMLR 2006»
15 years 6 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
« Prev « First page 2787 / 3064 Last » Next »