5169 search results - page 85 / 1034 » Locality approximation using time |
142
Voted
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
110
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
120
click to vote
SC
1995
ACM
15 years 6 months ago
1995
ACM
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
151
click to vote
DRR
2008
15 years 4 months ago
2008
Adaptive binarization is an important first step in many document analysis and OCR processes. This paper describes a fast adaptive binarization algorithm that yields the same qual...