843 search results - page 94 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
123
click to vote
PODS
2007
ACM
16 years 1 months ago
2007
ACM
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
249
Voted
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
140
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
126
click to vote
COCO
2003
Springer
15 years 6 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
116
click to vote
ICCD
2001
IEEE
15 years 10 months ago
2001
IEEE
We present a simulation-based semi-formal verification method for sequential circuits described at the registertransfer level. The method consists of an iterative loop where cove...