Sciweavers

4850 search results - page 56 / 970
» Approximate Data Structures with Applications
Sort
View
NIPS
1990
14 years 11 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
CIKM
1998
Springer
15 years 2 months ago
Ontology-Based Extraction and Structuring of Information from Data-Rich Unstructured Documents
We present a new approach to extracting information from unstructured documents based on an application ontology that describes a domain of interest. Starting with such an ontolog...
David W. Embley, Douglas M. Campbell, Randy D. Smi...
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 1 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi