Sciweavers

16404 search results - page 3012 / 3281
» A set coverage problem
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 9 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
169
Voted
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 9 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
BTW
2007
Springer
236views Database» more  BTW 2007»
15 years 9 months ago
A Classification of Schema Mappings and Analysis of Mapping Tools
: Schema mapping techniques for data exchange have become popular and useful tools both in research and industry. A schema mapping relates a source schema with a target schema via ...
Frank Legler, Felix Naumann
186
Voted
CASES
2007
ACM
15 years 9 months ago
Eliminating inter-process cache interference through cache reconfigurability for real-time and low-power embedded multi-tasking
We propose a technique which leverages configurable data caches to address the problem of cache interference in multitasking embedded systems. Data caches are often necessary to p...
Rakesh Reddy, Peter Petrov
153
Voted
CEC
2007
IEEE
15 years 9 months ago
A multi-layered solution for supporting isp traffic demand using genetic algorithm
This paper proposes a unique feedback governed multi layered architectural model to support ISP's traffic demands with multiple Quality of Service(QoS) constraints. The propos...
Gajaruban Kandavanam, Dmitri Botvich, Sasitharan B...
« Prev « First page 3012 / 3281 Last » Next »