Sciweavers

2925 search results - page 90 / 585
» Information Complexity of Online Problems
Sort
View
EDBT
2004
ACM
139views Database» more  EDBT 2004»
16 years 6 months ago
Efficient Distributed Skylining for Web Information Systems
Though skyline queries already have claimed their place in retrieval over central databases, their application in Web information systems up to now was impossible due to the distri...
Wolf-Tilo Balke, Ulrich Güntzer, Jason Xin Zh...
ICALP
2005
Springer
15 years 11 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ICNP
2002
IEEE
15 years 11 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
IEEECIT
2010
IEEE
15 years 4 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
COLING
1996
15 years 7 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury