Sciweavers

2300 search results - page 342 / 460
» Maximally Concurrent Programs
Sort
View
JMLR
2006
89views more  JMLR 2006»
15 years 2 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
116
Voted
ENTCS
2007
107views more  ENTCS 2007»
15 years 2 months ago
Applications = Components + GLoo
We are advocating a component-oriented software development approach that provides support for a clear separation between the computational and the compositional entities of an ap...
Markus Lumpe
EOR
2007
98views more  EOR 2007»
15 years 2 months ago
Location of terror response facilities: A game between state and terrorist
We study a leader follower game with two players: a terrorist and a state where the later one installs facilities that provide support in case of a terrorist attack. While the Ter...
Oded Berman, Arieh Gavious
NETWORKS
2008
15 years 2 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
TKDE
2008
121views more  TKDE 2008»
15 years 2 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...