Sciweavers

1461 search results - page 232 / 293
» Complexity of Graph Covering Problems
Sort
View
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 7 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
CVPR
2007
IEEE
14 years 10 months ago
Layered Depth Panoramas
Representations for interactive photorealistic visualization of scenes range from compact 2D panoramas to dataintensive 4D light fields. In this paper, we propose a technique for ...
Ke Colin Zheng, Sing Bing Kang, Michael F. Cohen, ...
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
14 years 3 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
MFCS
2009
Springer
14 years 3 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser