Sciweavers

7006 search results - page 1097 / 1402
» Approximation Algorithms
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
CEC
2011
IEEE
14 years 6 months ago
Stochastic Natural Gradient Descent by estimation of empirical covariances
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
Luigi Malagò, Matteo Matteucci, Giovanni Pi...
INFOCOM
1999
IEEE
15 years 11 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
16 years 5 days ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
15 years 1 months ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman
« Prev « First page 1097 / 1402 Last » Next »