5005 search results - page 155 / 1001 » The Design and Analysis of Parallel Algorithms |
111
click to vote
TSP
2008
15 years 20 days ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
105
click to vote
HT
2010
ACM
15 years 5 months ago
2010
ACM
Parallel browsing describes a behavior where users visit Web pages in multiple concurrent threads. Web browsers explicitly support this by providing tabs. Although parallel browsi...
95
Voted
HPCA
2008
IEEE
16 years 1 months ago
2008
IEEE
Recent advances in statistical inference and machine learning close the divide between simulation and classical optimization, thereby enabling more rigorous and robust microarchit...
122
Voted
IOPADS
1997
15 years 2 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
125
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...