Sciweavers

2131 search results - page 279 / 427
» Co-Scheduling of Computation and Data on Computer Clusters
Sort
View
IPPS
2005
IEEE
14 years 4 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 8 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
CIDM
2007
IEEE
14 years 2 months ago
An Efficient Distance Calculation Method for Uncertain Objects
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
Lurong Xiao, Edward Hung
SBACPAD
2007
IEEE
121views Hardware» more  SBACPAD 2007»
14 years 5 months ago
DTA-C: A Decoupled multi-Threaded Architecture for CMP Systems
One way to exploit Thread Level Parallelism (TLP) is to use architectures that implement novel multithreaded execution models, like Scheduled DataFlow (SDF). This latter model pro...
Roberto Giorgi, Zdravko Popovic, Nikola Puzovic
ICIP
2009
IEEE
14 years 11 months ago
Effective Initialization Of K-means For Color Quantization
Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms...