Sciweavers

384 search results - page 57 / 77
» On s-hamiltonian-connected line graphs
Sort
View
JEI
2006
82views more  JEI 2006»
13 years 8 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
DIAGRAMS
2008
Springer
13 years 10 months ago
Diagrammatic Logic of Existential Graphs: A Case Study of Commands
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
Ahti-Veikko Pietarinen
VMV
2008
187views Visualization» more  VMV 2008»
13 years 10 months ago
Patch-Graph Reconstruction for Piecewise Smooth Surfaces
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
Philipp Jenke, Michael Wand, Wolfgang Straße...
IPL
2008
89views more  IPL 2008»
13 years 8 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
ICSE
2008
IEEE-ACM
14 years 9 months ago
Debugging reinvented: asking and answering why and why not questions about program behavior
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
Andrew Jensen Ko, Brad A. Myers