Sciweavers

2200 search results - page 148 / 440
» Bloch's Constant is Computable
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Recovering Fluid-type Motions Using Navier-Stokes Potential Flow
The classical optical flow assumes that a feature point maintains constant brightness across the frames. For fluidtype motions such as smoke or clouds, the constant brightness ass...
Feng Li, Liwei Xu, Philippe Guyenne, Jingyi Yu
STACS
2010
Springer
16 years 1 months ago
Relaxed Spanners for Directed Disk Graphs
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
David Peleg, Liam Roditty
PODC
2006
ACM
16 years 13 days ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
PODC
2005
ACM
16 years 1 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 12 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke