Sciweavers

2300 search results - page 100 / 460
» Maximally Concurrent Programs
Sort
View
NIPS
2000
15 years 2 months ago
A New Approximate Maximal Margin Classification Algorithm
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
Claudio Gentile
PAMI
2010
168views more  PAMI 2010»
14 years 11 months ago
Nonnegative Least-Correlated Component Analysis for Separation of Dependent Sources by Volume Maximization
—Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challen...
Fa-Yu Wang, Chong-Yung Chi, Tsung-Han Chan, Yue Wa...
INFOCOM
2012
IEEE
13 years 3 months ago
Cherish every joule: Maximizing throughput with an eye on network-wide energy consumption
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou
92
Voted
ICFP
2006
ACM
16 years 20 days ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield
109
Voted
PLDI
2006
ACM
15 years 6 months ago
The Compressor: concurrent, incremental, and parallel compaction
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
Haim Kermany, Erez Petrank