Sciweavers

2215 search results - page 119 / 443
» Wide open spaces
Sort
View
ESOP
2009
Springer
15 years 4 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
IPPS
2009
IEEE
15 years 4 months ago
DMTCP: Transparent checkpointing for cluster computations and the desktop
DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wid...
Jason Ansel, Kapil Arya, Gene Cooperman
WIKIS
2006
ACM
15 years 3 months ago
Semantic Wikipedia
Wikipedia is the world’s largest collaboratively edited source of encyclopaedic knowledge. But in spite of its utility, its contents are barely machine-interpretable. Structural...
Heiko Haller, Markus Krötzsch, Max Völke...
SIGIR
2012
ACM
13 years 11 days ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
CISIS
2010
IEEE
15 years 4 months ago
Semantic Integration of Heterogeneous Data Sources for Monitoring Frequent-Release Software Projects
Abstract—Open source software teams routinely develop complex software products in frequent-release settings with rather lightweight processes and project documentation. In this ...
Stefan Biffl, Wikan Danar Sunindyo, Thomas Moser