Sciweavers

4850 search results - page 832 / 970
» Approximate Data Structures with Applications
Sort
View
COMPGEOM
2007
ACM
15 years 2 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
DAS
2008
Springer
14 years 12 months ago
Towards Whole-Book Recognition
We describe experimental results for unsupervised recognition of the textual contents of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment s...
Pingping Xiu, Henry S. Baird
LREC
2010
198views Education» more  LREC 2010»
14 years 11 months ago
The Cambridge Cookie-Theft Corpus: A Corpus of Directed and Spontaneous Speech of Brain-Damaged Patients and Healthy Individuals
Investigating differences in linguistic usage between individuals who have suffered brain injury (hereafter patients) and those who haven't can yield a number of benefits. It...
Caroline Williams, Andrew Thwaites, Paula Buttery,...
BMCBI
2008
242views more  BMCBI 2008»
14 years 10 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
BMCBI
2007
140views more  BMCBI 2007»
14 years 10 months ago
Evaluation of high-throughput functional categorization of human disease genes
Background: Biological data that are well-organized by an ontology, such as Gene Ontology, enables high-throughput availability of the semantic web. It can also be used to facilit...
James L. Chen, Yang Liu, Lee T. Sam, Jianrong Li, ...