Sciweavers

520 search results - page 19 / 104
» Subset Counting in Trees
Sort
View
DIS
2003
Springer
14 years 29 days ago
Prediction of Molecular Bioactivity for Drug Design Using a Decision Tree Algorithm
Abstract. A machine learning-based approach to the prediction of molecular bioactivity in new drugs is proposed. Two important aspects are considered for the task: feature subset s...
Sanghoon Lee, Jihoon Yang, Kyung-Whan Oh
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
ACL
2008
13 years 9 months ago
Correcting Misuse of Verb Forms
This paper proposes a method to correct English verb form errors made by non-native speakers. A basic approach is template matching on parse trees. The proposed method improves on...
John Lee, Stephanie Seneff
NIPS
1998
13 years 9 months ago
Restructuring Sparse High Dimensional Data for Effective Retrieval
The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, docu...
Charles Lee Isbell Jr., Paul A. Viola
LICS
2005
IEEE
14 years 1 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin