9842 search results - page 1685 / 1969 » The Complexity of the Matching-Cut Problem |
198
click to vote
ECCV
2008
Springer
16 years 2 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 ...
145
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
150
click to vote
EDBT
2010
ACM
15 years 11 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...
142
click to vote
SAC
2009
ACM
15 years 11 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...
141
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...