Sciweavers

3600 search results - page 71 / 720
» The settling-time reducibility ordering
Sort
View
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 6 months ago
Logical settings for concept learning from incomplete examples in First Order Logic
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
Dominique Bouthinon, Henry Soldano, Véroniq...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 7 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
POPL
2010
ACM
16 years 3 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
COCOON
2005
Springer
15 years 11 months ago
Quartet-Based Phylogeny Reconstruction from Gene Orders
Abstract. Phylogenetic reconstruction from gene-rearrangement data is attracting increasing attention from biologists and computer scientists. Methods used in reconstruction includ...
Tao Liu, Jijun Tang, Bernard M. E. Moret
COLING
2000
15 years 7 months ago
Unscrambling English word order
We propose a treatment of `extraposition' which allows items to be assimilated directly even when they appear far from their canonical positions. This treatment supports anal...
Allan Ramsay, Helen Seville