14699 search results - page 385 / 2940 » Complexity and Cognitive Computing |
218
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
212
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
125
click to vote
VLSID
2007
IEEE
16 years 5 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
142
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
111
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...