375 search results - page 75 / 75 » Making Abstract Machines Less Abstract |
PVM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
VLSISP
2010
13 years 6 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
SENSYS
2010
ACM
13 years 6 months ago
2010
ACM
Supporting continuous sensing applications on mobile phones is challenging because of the resource demands of long-term sensing, inference and communication algorithms. We present...
ICDCS
2012
IEEE
11 years 11 months ago
2012
IEEE
—Virtual coordinate systems (VCS) provide accurate estimations of latency between arbitrary hosts on a network, while conducting a small amount of actual measurements and relying...
FUN
2010
Springer
14 years 1 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...