Sciweavers

942 search results - page 143 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 11 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 3 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
IAT
2010
IEEE
13 years 8 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
TOG
2008
291views more  TOG 2008»
13 years 9 months ago
Interactive 3D architectural modeling from unordered photo collections
We present an interactive system for generating photorealistic, textured, piecewise-planar 3D models of architectural structures and urban scenes from unordered sets of photograph...
Sudipta N. Sinha, Drew Steedly, Richard Szeliski, ...
ICDCS
2006
IEEE
14 years 4 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu