Sciweavers

1809 search results - page 265 / 362
» Weakly Computable Real Numbers
Sort
View
HPDC
2007
IEEE
14 years 3 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
WWW
2005
ACM
14 years 9 months ago
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
Utku Irmak, Torsten Suel
HPCA
2009
IEEE
14 years 9 months ago
A first-order fine-grained multithreaded throughput model
Analytical modeling is an alternative to detailed performance simulation with the potential to shorten the development cycle and provide additional insights. This paper proposes a...
Xi E. Chen, Tor M. Aamodt
CIDM
2007
IEEE
14 years 3 months ago
Incremental Local Outlier Detection for Data Streams
Outlier detection has recently become an important problem in many industrial and financial applications. This problem is further complicated by the fact that in many cases, outlie...
Dragoljub Pokrajac, Aleksandar Lazarevic, Longin J...