Sciweavers

142 search results - page 13 / 29
» Detecting similar Java classes using tree algorithms
Sort
View
NIPS
2004
13 years 9 months ago
Active Learning for Anomaly and Rare-Category Detection
We introduce a novel active-learning scenario in which a user wants to work with a learning algorithm to identify useful anomalies. These are distinguished from the traditional st...
Dan Pelleg, Andrew W. Moore
ICPP
2008
IEEE
14 years 2 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...
INTERSPEECH
2010
13 years 2 months ago
Coping imbalanced prosodic unit boundary detection with linguistically-motivated prosodic features
Continuous speech input for ASR processing is usually presegmented into speech stretches by pauses. In this paper, we propose that smaller, prosodically defined units can be ident...
Yi-Fen Liu, Shu-Chuan Tseng, Jyh-Shing Roger Jang,...
KCAP
2003
ACM
14 years 26 days ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
LPAR
2004
Springer
14 years 1 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel