Sciweavers

3020 search results - page 69 / 604
» Optimal partition trees
Sort
View
PE
2011
Springer
167views Optimization» more  PE 2011»
15 years 29 days ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
PVLDB
2010
123views more  PVLDB 2010»
15 years 4 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...
ICIP
2007
IEEE
15 years 10 months ago
H.263 to H.264 Transconding using Data Mining
1 In this paper, we propose the use of data mining algorithms to create a macroblock partition mode decision algorithm for inter-frame prediction, to be used as part of a high-effi...
Gerardo Fernández-Escribano, Jens Bialkowsk...
PDPTA
2007
15 years 7 months ago
An Implementation of Parallel File Distribution in an Agent Hierarchy
AgentTeamwork coordinates parallel job execution in a hierarchy of mobile agents. A collection of specialized agents are deployed to remote sites including multiple clusters so as...
Jumpei Miyauchi, Munehiro Fukuda, Joshua Phillips
EOR
2006
130views more  EOR 2006»
15 years 6 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni