Sciweavers

2223 search results - page 276 / 445
» Multimedia structuring using trees
Sort
View
176
Voted
MTA
2010
110views more  MTA 2010»
15 years 4 months ago
Thesaurus enrichment for query expansion in audiovisual archives
It is common practice in audiovisual archives to disclose documents using metadata from a structured vocabulary or thesaurus. Many of these thesauri have limited or no structure. T...
Laura Hollink, Véronique Malaisé, Gu...
NIPS
1990
15 years 7 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
233
Voted
CPP
2011
107views more  CPP 2011»
14 years 6 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 10 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
152
Voted
CIKM
1994
Springer
15 years 10 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet