9842 search results - page 1476 / 1969 » Problem complexity |
206
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
207
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
259
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
210
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
189
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...