Sciweavers

3072 search results - page 245 / 615
» Shape analysis algorithm based on information theory
Sort
View
ISSTA
2009
ACM
16 years 1 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
CLEF
2007
Springer
16 years 21 days ago
Robust Question Answering for Speech Transcripts Using Minimal Syntactic Analysis
Abstract. This paper describes the participation of the Technical University of Catalonia in the CLEF 2007 Question Answering on Speech Transcripts track. For the processing of man...
Pere Comas, Jordi Turmo, Mihai Surdeanu
ADC
2005
Springer
183views Database» more  ADC 2005»
16 years 2 days ago
Discovering User Access Pattern Based on Probabilistic Latent Factor Model
There has been an increased demand for characterizing user access patterns using web mining techniques since the informative knowledge extracted from web server log files can not ...
Guandong Xu, Yanchun Zhang, Jiangang Ma, Xiaofang ...
DAWAK
2010
Springer
15 years 7 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
SIGMETRICS
2006
ACM
121views Hardware» more  SIGMETRICS 2006»
16 years 14 days ago
Transient analysis of tree-Like processes and its application to random access systems
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...