Sciweavers

90 search results - page 18 / 18
» Discovering Classes of Strongly Equivalent Logic Programs
Sort
View
ALT
1995
Springer
13 years 9 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ICML
2004
IEEE
14 years 6 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
ICSE
2008
IEEE-ACM
14 years 6 months ago
A study of student strategies for the corrective maintenance of concurrent software
Graduates of computer science degree programs are increasingly being asked to maintain large, multi-threaded software systems; however, the maintenance of such systems is typicall...
Scott D. Fleming, Eileen Kraemer, R. E. Kurt Stire...
KDD
2004
ACM
213views Data Mining» more  KDD 2004»
13 years 10 months ago
Analytical view of business data
This paper describes a logical extension to Microsoft Business Framework (MBF) called Analytical View (AV). AV consists of three components: Model Service for design time, Busines...
Adam Yeh, Jonathan Tang, Youxuan Jin, Sam Skrivan
BMCBI
2006
127views more  BMCBI 2006»
13 years 5 months ago
Automatic discovery of cross-family sequence features associated with protein function
Background: Methods for predicting protein function directly from amino acid sequences are useful tools in the study of uncharacterised protein families and in comparative genomic...
Markus Brameier, Josien Haan, Andrea Krings, Rober...