15033 search results - page 198 / 3007 » Complexity Theory and Algorithms |
155
click to vote
PAMI
2011
14 years 7 months ago
2011
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
153
click to vote
DALT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted t...
125
click to vote
ECIS
2004
15 years 5 months ago
2004
As Information Systems (IS) research increasingly acknowledges the importance of non-positivist approaches, the case for a plurality of theories to guide qualitative studies has g...
139
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
112
click to vote
EOR
2010
15 years 4 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...