1554 search results - page 112 / 311 » Parameterized Complexity and Approximation Algorithms |
138
Voted
SIGMOD
2008
ACM
15 years 3 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
230
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
145
Voted
TAMC
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
121
click to vote
TON
2008
15 years 3 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
136
click to vote
ICANNGA
2007
Springer
15 years 7 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...