Sciweavers

144227 search results - page 190 / 28846
» Using
Sort
View
BMCBI
2005
152views more  BMCBI 2005»
15 years 7 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
JCM
2007
131views more  JCM 2007»
15 years 7 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
CGF
2000
78views more  CGF 2000»
15 years 7 months ago
Using an Intermediate Skeleton and Inverse Kinematics for Motion Retargeting
In this paper, we present a new method for solving the Motion Retargeting Problem, by using an intermediate skeleton. This allows us to convert movements between hierarchically an...
Jean-Sébastien Monzani, Paolo Baerlocher, R...
COLING
2002
15 years 7 months ago
Using an Ontology to Determine English Countability
In this paper we show to what degree the countability of English nouns is predictable from their semantics. We found that at 78% of nouns' countability could be predicted usi...
Francis Bond, Caitlin Vatikiotis-Bateson
JCS
2000
148views more  JCS 2000»
15 years 7 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton
« Prev « First page 190 / 28846 Last » Next »