Sciweavers

1639 search results - page 287 / 328
» Towards a theory of shared data in distributed systems
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
15 years 6 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
SPAA
2005
ACM
15 years 11 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
ICPP
2003
IEEE
15 years 11 months ago
Dynamic Control Frames in Reservation-Based Packet Scheduling for Single-Hop WDM Networks
In reservation-based packet scheduling algorithms for single-hop WDM networks, one of the wavelengths is used as a control channel which is shared by all of the nodes for transmit...
Hwa-Chun Lin, Pei-Shin Liu
SIGIR
2006
ACM
16 years 4 days ago
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
Memory-based methods for collaborative filtering predict new ratings by averaging (weighted) ratings between, respectively, pairs of similar users or items. In practice, a large ...
Jun Wang, Arjen P. de Vries, Marcel J. T. Reinders
HPCA
2006
IEEE
16 years 6 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal