Sciweavers

93 search results - page 14 / 19
» What Makes the Arc-Preserving Subsequence Problem Hard
Sort
View
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 7 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
GECCO
2007
Springer
308views Optimization» more  GECCO 2007»
14 years 1 months ago
Multiobjective clustering with automatic k-determination for large-scale data
Web mining - data mining for web data - is a key factor of web technologies. Especially, web behavior mining has attracted a great deal of attention recently. Behavior mining invo...
Nobukazu Matake, Tomoyuki Hiroyasu, Mitsunori Miki...
VEE
2006
ACM
126views Virtualization» more  VEE 2006»
14 years 1 months ago
A new approach to real-time checkpointing
The progress towards programming methodologies that simplify the work of the programmer involves automating, whenever possible, activities that are secondary to the main task of d...
Antonio Cunei, Jan Vitek
HT
2010
ACM
14 years 14 days ago
Of categorizers and describers: an evaluation of quantitative measures for tagging motivation
While recent research has advanced our understanding about the structure and dynamics of social tagging systems, we know little about (i) the underlying motivations for tagging (w...
Christian Körner, Roman Kern, Hans-Peter Grah...
VTS
2006
IEEE
122views Hardware» more  VTS 2006»
14 years 1 months ago
Mixed PLB and Interconnect BIST for FPGAs Without Fault-Free Assumptions
We tackle the problem of fault-free assumptions in current PLB and interconnect built-in-self-test (BIST) techniques for FPGAs. These assumptions were made in order to develop stro...
Vishal Suthar, Shantanu Dutt