Sciweavers

822 search results - page 81 / 165
» Contention in shared memory algorithms
Sort
View
WWW
2011
ACM
13 years 3 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
IUI
2009
ACM
14 years 5 months ago
You can play that again: exploring social redundancy to derive highlight regions in videos
Identifying highlights in multimedia content such as video and audio is currently a very difficult technical problem. We present and evaluate a novel algorithm that identifies hig...
Jose San Pedro, Vaiva Kalnikaité, Steve Whi...
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
14 years 2 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
HIPC
2005
Springer
14 years 2 months ago
Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lub...
COMPGEOM
2009
ACM
14 years 3 months ago
Parallel geometric algorithms for multi-core computers
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
Vicente H. F. Batista, David L. Millman, Sylvain P...