Sciweavers

3267 search results - page 497 / 654
» Computational Models of Language Acquisition
Sort
View
EUROCOLT
1999
Springer
15 years 8 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
ENTCS
2007
108views more  ENTCS 2007»
15 years 4 months ago
Generating Java Compiler Optimizers Using Bidirectional CTL
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
Ling Fang, Masataka Sassa
HT
1997
ACM
15 years 8 months ago
As We Should Have Thought
The hypermedia field has long realized the need for firstructural abstractions. However, we have failed to generalize the concept of ubiquitous structure management to problem dom...
Peter J. Nürnberg, John J. Leggett, Erich R. ...
CIDM
2007
IEEE
15 years 8 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
SMA
2010
ACM
181views Solid Modeling» more  SMA 2010»
15 years 4 months ago
Merging and smoothing machining boundaries on cutter location surfaces
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
Weishi Li, Ralph R. Martin, Frank C. Langbein