Sciweavers

2229 search results - page 298 / 446
» Comparative analysis of biclustering algorithms
Sort
View
WWW
2008
ACM
14 years 11 months ago
Circular context-based semantic matching to identify web service composition
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...
Aviv Segev
KDD
2007
ACM
167views Data Mining» more  KDD 2007»
14 years 10 months ago
Multiscale topic tomography
Modeling the evolution of topics with time is of great value in automatic summarization and analysis of large document collections. In this work, we propose a new probabilistic gr...
Ramesh Nallapati, Susan Ditmore, John D. Lafferty,...
WWW
2010
ACM
14 years 5 months ago
Keyword extraction for social snippets
Today, a huge amount of text is being generated for social purposes on social networking services on the Web. Unlike traditional documents, such text is usually extremely short an...
Zhenhui Li, Ding Zhou, Yun-Fang Juan, Jiawei Han
IEAAIE
2009
Springer
14 years 5 months ago
Robust Singular Spectrum Transform
Change Point Discovery is a basic algorithm needed in many time series mining applications including rule discovery, motif discovery, casual analysis, etc. Several techniques for c...
Yasser F. O. Mohammad, Toyoaki Nishida
RTAS
2008
IEEE
14 years 4 months ago
Using Trace Scratchpads to Reduce Execution Times in Predictable Real-Time Architectures
Instruction scratchpads have been previously suggested as a way to reduce the worst case execution time (WCET) of hard real-time programs without introducing the analysis issues p...
Jack Whitham, Neil C. Audsley