Sciweavers

2370 search results - page 136 / 474
» A Structured Set of Higher-Order Problems
Sort
View
141
Voted
PPOPP
2005
ACM
15 years 9 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
155
Voted
EDBT
2012
ACM
247views Database» more  EDBT 2012»
13 years 5 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
112
Voted
ICALP
2005
Springer
15 years 9 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...
110
Voted
STOC
2003
ACM
136views Algorithms» more  STOC 2003»
16 years 3 months ago
Alpha-shapes and flow shapes are homotopy equivalent
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
Tamal K. Dey, Joachim Giesen, Matthias John
EMNLP
2010
15 years 1 months ago
Word Sense Induction Disambiguation Using Hierarchical Random Graphs
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
Ioannis P. Klapaftis, Suresh Manandhar