Sciweavers

11213 search results - page 1801 / 2243
» Low-contention data structures
Sort
View
174
Voted
FOIS
2006
15 years 8 months ago
Modular Ontology Design Using Canonical Building Blocks in the Biochemistry Domain
The field of BioInformatics has become a major venue for the development and application of computational ontologies. Ranging from controlled vocabularies to annotation of experim...
Christopher J. Thomas, Amit P. Sheth, William S. Y...
217
Voted
DAGSTUHL
2001
15 years 8 months ago
An Overview of the GXL Graph Exchange Language
GXL (Graph eXchange Language) is designed to be a standard exchange format for graph-based tools. GXL is defined as an XML sublanguage, which offers support for exchanging instanc...
Andreas Winter, Bernt Kullbach, Volker Riediger
UAI
2003
15 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
166
Voted
FLAIRS
1998
15 years 8 months ago
An AI Approach to Computer Assisted Tomography
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
John F. Kolen, David A. Shamma, Thomas Reichherzer...
212
Voted
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 8 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
« Prev « First page 1801 / 2243 Last » Next »