Sciweavers

10 search results - page 2 / 2
» Parameterized Complexity Results in Symmetry Breaking
Sort
View
CVPR
2005
IEEE
14 years 7 months ago
Complex 3D Shape Recovery Using a Dual-Space Approach
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
Chen Liang, Kwan-Yee Kenneth Wong
CAGD
2006
114views more  CAGD 2006»
13 years 5 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 5 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
ICPADS
2006
IEEE
13 years 11 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
SPAA
2009
ACM
14 years 2 days ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn