Sciweavers

6365 search results - page 1043 / 1273
» Fast Local Computation Algorithms
Sort
View
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
181
Voted
HPDC
2010
IEEE
15 years 7 months ago
Comparison of resource platform selection approaches for scientific workflows
Cloud computing is increasingly considered as an additional computational resource platform for scientific workflows. The cloud offers opportunity to scale-out applications from d...
Yogesh L. Simmhan, Lavanya Ramakrishnan
CIKM
2009
Springer
16 years 1 months ago
On the feasibility of multi-site web search engines
Web search engines are often implemented as centralized systems. Designing and implementing a Web search engine in a distributed environment is a challenging engineering task that...
Ricardo A. Baeza-Yates, Aristides Gionis, Flavio J...
FOCS
2007
IEEE
16 years 29 days ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 8 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
« Prev « First page 1043 / 1273 Last » Next »