569 search results - page 58 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
ICAI
2003
13 years 9 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
IEAAIE
2000
Springer
13 years 11 months ago
2000
Springer
Business information received from advanced data analysis and data mining is a critical success factor for companies wishing to maximize competitive advantage. The use of tradition...
RTSS
1999
IEEE
13 years 12 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
ICASSP
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...
IEEEMSP
2002
IEEE
14 years 18 days ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...