Sciweavers

192 search results - page 30 / 39
» Comparing two approaches to dynamic, distributed constraint ...
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
ICC
2007
IEEE
193views Communications» more  ICC 2007»
14 years 1 months ago
Cost-Effective MAP Selection in HMIPv6 Networks
— In Hierarchical Mobile IPv6(HMIPv6) networks, the system performance is critically affected by the selection of Mobile Anchor Points(MAPs) and its load status. Thus, in this pa...
Wonsik Chung, SuKyoung Lee
SPAA
2012
ACM
11 years 10 months ago
Memory-mapping support for reducer hyperobjects
hyperobjects (reducers) provide a linguistic abstraction for dynamic multithreading that allows different branches of a parallel program to maintain coordinated local views of the...
I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leis...
HCW
2000
IEEE
13 years 12 months ago
Fast and Effective Task Scheduling in Heterogeneous Systems
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
Andrei Radulescu, Arjan J. C. van Gemund
TASLP
2008
129views more  TASLP 2008»
13 years 7 months ago
Chroma Binary Similarity and Local Alignment Applied to Cover Song Identification
Abstract--We present a new technique for audio signal comparison based on tonal subsequence alignment and its application to detect cover versions (i.e., different performances of ...
Joan Serrà, Emilia Gómez, Perfecto H...