5109 search results - page 238 / 1022 » On Learning Limiting Programs |
142
click to vote
SIGCSE
1997
ACM
15 years 10 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
154
click to vote
AAAI
2008
15 years 8 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
174
click to vote
FLAIRS
2006
15 years 7 months ago
2006
We have been using the concept map of the domain, enhanced with pedagogical concepts called learning objectives, as the overlay student model in our intelligent tutors for program...
188
Voted
ML
2010
ACM
15 years 4 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
199
click to vote
ILP
2007
Springer
16 years 17 days ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...