Sciweavers

2372 search results - page 469 / 475
» Probabilistic calling context
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 6 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
INTERACTIONS
2010
109views more  INTERACTIONS 2010»
13 years 6 months ago
The climate change habitability index
rate, the CCHI is defined abstractly as a metric that can be stated in ordinary language and diagrams that allows people to answer the following three questions related to sustaina...
Yue Pan, Chit Meng Cheong, Eli Blevis
RSA
2008
80views more  RSA 2008»
13 years 6 months ago
The persistent-access-caching algorithm
ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching syste...
Predrag R. Jelenkovic, Ana Radovanovic
JIDM
2010
145views more  JIDM 2010»
13 years 6 months ago
Mining Relevant and Extreme Patterns on Climate Time Series with CLIPSMiner
One of the most important challenges for the researchers in the 21st Century is related to global heating and climate change that can have as consequence the intensification of na...
Luciana A. S. Romani, Ana Maria Heuminski de &Aacu...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 6 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno