4526 search results - page 568 / 906 » Algorithmic problems related to the Internet |
210
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
152
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
274
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
343
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
181
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...