9325 search results - page 1408 / 1865 » The decentralized implementability problem |
205
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
188
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
The functionality of extensible database servers can be augmented by user-de ned functions UDFs . However, the server's security and stability are concerns whenever new code...
156
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
189
click to vote
ER
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In this paper we argue that many of the problems one may experience while visiting websites today may be avoided if their builders adopt a proper methodology for designin...
203
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...