Sciweavers

413 search results - page 21 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
PSD
2004
Springer
79views Database» more  PSD 2004»
15 years 11 months ago
A Fast Network Flows Heuristic for Cell Suppression in Positive Tables
Abstract. Current network flows heuristics for cell suppression in positive tables (i.e, cell values are greater or equal than zero) rely on the solution of several minimum-cost s...
Jordi Castro
EUROPAR
2005
Springer
15 years 11 months ago
The Combined Perceptron Branch Predictor
— Previous works have shown that neural branch prediction techniques achieve far lower misprediction rate than traditional approaches. We propose a neural predictor based on two ...
Matteo Monchiero, Gianluca Palermo
249
Voted
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
16 years 6 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...
199
Voted
CORR
2011
Springer
261views Education» more  CORR 2011»
15 years 1 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
172
Voted
ICOIN
2005
Springer
15 years 11 months ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...