Sciweavers

157 search results - page 26 / 32
» The duality of computation
Sort
View
GROUP
2003
ACM
14 years 26 days ago
Communities of action: a cognitive and social approach to the design of CSCW systems
Most current theories about collective cognitive activities in limited groups apply to structurally closed co-operative situations Here we propose to work in the framework of inte...
Manuel Zacklad
NIPS
2008
13 years 9 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 7 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
FS
2006
84views more  FS 2006»
13 years 7 months ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 7 months ago
Bipartite-Uniform Hypermaps on the Sphere
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
Antonio Breda d'Azevedo, Rui Duarte