Sciweavers

2200 search results - page 42 / 440
» Bloch's Constant is Computable
Sort
View
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 11 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
MICCAI
2005
Springer
15 years 10 months ago
A Physical Model for DT-MRI Based Connectivity Map Computation
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Burak Acar, Erdem Yörük, Roland Bammer
MM
2006
ACM
122views Multimedia» more  MM 2006»
15 years 3 months ago
Human computing for interactive digital media
Widespread adoption of interactive, peer-to-peer digital media will require a solution to the Privacy, Sharing, and Interest (PSI) problem: how can we know what the user wants to ...
Alex Pentland, Jonathan Gips, Wen Dong, Will Stolt...
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
TRANSCI
2008
80views more  TRANSCI 2008»
14 years 9 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...