Sciweavers

3146 search results - page 231 / 630
» Efficient Consequence Finding
Sort
View
AMR
2005
Springer
96views Multimedia» more  AMR 2005»
16 years 5 days ago
Improving Access to Multimedia Using Multi-source Hierarchical Meta-data
Efficient retrieval of multi-media content depends on the availability of adequate meta-data to indicate the nature of the content. Such meta-data often contains useful hierarchica...
Trevor P. Martin, Yun Shen
GECCO
2004
Springer
16 years 22 hour ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ICANNGA
2009
Springer
141views Algorithms» more  ICANNGA 2009»
15 years 11 months ago
Connection Strategies in Associative Memory Models with Spiking and Non-spiking Neurons
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
Weiliang Chen, Reinoud Maex, Rod Adams, Volker Ste...
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
15 years 11 months ago
Optimal Retiming for Initial State Computation
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state f...
Peichen Pan, Guohua Chen
SSDBM
1998
IEEE
95views Database» more  SSDBM 1998»
15 years 11 months ago
SRQL: Sorted Relational Query Language
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g., a sequence of stock prices), and users want to pose queries that reflect this...
Raghu Ramakrishnan, Donko Donjerkovic, Arvind Rang...