Sciweavers

29908 search results - page 337 / 5982
» On the complexity of communication complexity
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
15 years 8 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
FCT
2007
Springer
15 years 8 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
DEBS
2008
ACM
15 years 8 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
EUROPAR
2008
Springer
15 years 8 months ago
Reducing Kernel Development Complexity in Distributed Environments
Setting up generic and fully transparent distributed services for clusters implies complex and tedious kernel developments. More flexible approaches such as user-space libraries ar...
Adrien Lebre, Renaud Lottiaux, Erich Focht, Christ...
IJCAI
2007
15 years 8 months ago
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Electoral control refers to attempts by an election’s organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreak...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...