Sciweavers

605 search results - page 21 / 121
» Parameterized Dynamic Tables
Sort
View
142
Voted
IEEEARES
2006
IEEE
15 years 9 months ago
Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Matthew Leslie, Jim Davies, Todd Huffman
133
Voted
DAWAK
2010
Springer
15 years 4 months ago
A Model-Driven Heuristic Approach for Detecting Multidimensional Facts in Relational Data Sources
Facts are multidimensional concepts of primary interests for knowledge workers because they are related to events occurring dynamically in an organization. Normally, these concepts...
Andrea Carmè, Jose-Norberto Mazón, S...
134
Voted
JNW
2006
145views more  JNW 2006»
15 years 3 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
106
Voted
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 10 months ago
Sensitivity analysis and computational uncertainty with applications to control of nonlinear parabolic partial differential equa
— In this paper we illustrate how sensitivities can be used to provide a practical precursor to dynamic transitions and numerical uncertainty in parameterized nonlinear parabolic...
John A. Burns, Lisa G. Davis
113
Voted
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
15 years 7 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan