Sciweavers

7988 search results - page 1507 / 1598
» A Useful Undecidable Theory
Sort
View
136
Voted
SIGSOFT
2009
ACM
15 years 10 months ago
Automatic synthesis of behavior protocols for composable web-services
Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing...
Antonia Bertolino, Paola Inverardi, Patrizio Pelli...
SPAA
2009
ACM
15 years 10 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
157
Voted
WWW
2009
ACM
15 years 10 months ago
StatSnowball: a statistical approach to extracting entity relationships
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
Jun Zhu, Zaiqing Nie, Xiaojiang Liu, Bo Zhang, Ji-...
ICS
2009
Tsinghua U.
15 years 10 months ago
MPI-aware compiler optimizations for improving communication-computation overlap
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
Anthony Danalis, Lori L. Pollock, D. Martin Swany,...
132
Voted
LCTRTS
2009
Springer
15 years 10 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard
« Prev « First page 1507 / 1598 Last » Next »