Sciweavers

577 search results - page 46 / 116
» Smartsockets: solving the connectivity problems in grid comp...
Sort
View
CVPR
2009
IEEE
16 years 7 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
ICALP
2007
Springer
15 years 6 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
IFIP
2005
Springer
15 years 5 months ago
Numerical Approximation of a Control Problem for Advection-Diffusion Processes
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
Alfio Quarteroni, Gianluigi Rozza, L. Dedè,...
ICIW
2009
IEEE
15 years 6 months ago
An Architecture for Reliable Mobile Workflow in a Grid Environment
— Mobile peer to peer (P2P) computing is becoming a major revolution in computing owing to advances in computing power, network connectivity and storage capacity of mobile device...
Bill Karakostas, George Fakas
DAM
2008
114views more  DAM 2008»
14 years 12 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy