Sciweavers

2925 search results - page 64 / 585
» Information Complexity of Online Problems
Sort
View
SP
2002
IEEE
114views Security Privacy» more  SP 2002»
15 years 5 months ago
Efficiently building on-line tools for distributed heterogeneous environments
Software development is getting more and more complex, especially within distributed middleware-based environments. A major drawback during the overall software development proces...
Günther Rackl, Thomas Ludwig 0002, Markus Lin...
WAIM
2010
Springer
15 years 3 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
ISMIS
2003
Springer
15 years 11 months ago
Searching for the Complex Decision Reducts: The Case Study of the Survival Analysis
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
Jan G. Bazan, Andrzej Skowron, Dominik Slezak, Jak...
STACS
1999
Springer
15 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICCL
1998
IEEE
15 years 10 months ago
Controlled Self-Applicable On-Line Partial Evaluation, Using Strategies
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
M. Beckman, Samuel N. Kamin