11565 search results - page 95 / 2313 » Computing Minimal Mappings |
151
click to vote
CLOUD
2010
ACM
15 years 8 months ago
2010
ACM
Parallel dataflow programs generate enormous amounts of distributed data that are short-lived, yet are critical for completion of the job and for good run-time performance. We ca...
158
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
127
click to vote
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
—Traditional authentication systems employed on Internet are facing an acute problem of intrusions. In this context we propose a neural architecture for user authentication throu...
119
click to vote
KES
2004
Springer
15 years 9 months ago
2004
Springer
In Simultaneous Localisation and Mapping (SLAM) the correspondence problem, specifically detecting cycles, is one of the most difficult challenges for an autonomous mobile robot. ...
136
click to vote
TCS
2011
14 years 10 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .