Sciweavers

6105 search results - page 1033 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
NETWORKS
2008
15 years 6 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
TALG
2008
81views more  TALG 2008»
15 years 6 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
TIT
2008
129views more  TIT 2008»
15 years 6 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
TVLSI
2008
90views more  TVLSI 2008»
15 years 6 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis
CONNECTION
2004
93views more  CONNECTION 2004»
15 years 6 months ago
A real-time robotic model of human reference resolution using visual constraints
Evidence from recent psycholinguistic experiments suggests that humans resolve reference incrementally in the presence of constraining visual context. In this paper, we present an...
Matthias Scheutz, Kathleen M. Eberhard, Virgil And...
« Prev « First page 1033 / 1221 Last » Next »