Sciweavers

1955 search results - page 126 / 391
» Can Computers Handle Adverbs
Sort
View
CONCUR
2006
Springer
15 years 8 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
FTDCS
2004
IEEE
15 years 8 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller
EUROPAR
2006
Springer
15 years 8 months ago
Supporting Reconfigurable Parallel Multimedia Applications
Abstract. Programming multimedia applications for System-on-Chip (SoC) architectures is difficult because streaming communication, user event handling, reconfiguration, and paralle...
Maik Nijhuis, Herbert Bos, Henri E. Bal
ICPADS
1998
IEEE
15 years 8 months ago
Fault Tolerant All-to-All Broadcast in General Interconnection Networks
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin, Keqin ...
KDD
2000
ACM
145views Data Mining» more  KDD 2000»
15 years 8 months ago
IntelliClean: a knowledge-based intelligent data cleaner
Existing data cleaning methods work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall is achieved by accepting records wi...
Mong-Li Lee, Tok Wang Ling, Wai Lup Low