486 search results - page 69 / 98 » Improved upper bounds for 3-SAT |
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
ICCV
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
LICS
1997
IEEE
14 years 21 days ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...