2814 search results - page 183 / 563 » Competitive Analysis of Distributed Algorithms |
133
Voted
EMMCVPR
2003
Springer
15 years 6 months ago
2003
Springer
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
96
Voted
INFORMATICALT
2006
15 years 24 days ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
85
Voted
CLUSTER
2004
IEEE
15 years 4 months ago
2004
IEEE
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
117
Voted
PAMI
2011
14 years 3 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 ...
103
click to vote
IEEEPACT
2000
IEEE
15 years 5 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...