1066 search results - page 18 / 214 » Computing Private Set Operations with Linear Complexities |
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
123
click to vote
JPDC
2007
14 years 9 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
IJCAI
2003
14 years 11 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
84
Voted
CVIU
2008
14 years 9 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...