Sciweavers

519 search results - page 48 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 1 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
CISIS
2010
IEEE
15 years 6 months ago
A Parallel Programming Framework for Multi-core DNA Sequence Alignment
—A new parallel programming framework for DNA sequence alignment in homogeneous multi-core processor architectures is proposed. Contrasting with traditional coarse-grained parall...
Tiago Jose Barreiros Martins de Almeida, Nuno Fili...
AAAI
2006
15 years 2 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
LICS
2009
IEEE
15 years 8 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons
ERSHOV
2003
Springer
15 years 6 months ago
The Outside-In Method of Teaching Introductory Programming
The new design for the introductory programming course at ETH relies on object technology, Eiffel, extensive reuse, a graphics-rich library (TRAFFIC) built specifically for the c...
Bertrand Meyer