Sciweavers

100 search results - page 8 / 20
» Simple Analysis of Graph Tests for Linearity and PCP
Sort
View
NHM
2010
79views more  NHM 2010»
13 years 2 months ago
Small solids in an inviscid fluid
We present in this paper several results concerning a simple model of interaction between an inviscid fluid, modeled by the Burgers equation, and a particle, assumed to be point-wi...
Boris Andreianov, Frédéric Lagouti&e...
IPL
2007
101views more  IPL 2007»
13 years 7 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
ICDAR
2003
IEEE
14 years 20 days ago
An Evolutionary Algorithm for General Symbol Segmentation
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
Stephen Pearce, Maher Ahmed
COMPGEOM
2010
ACM
14 years 13 days ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
PASTE
2005
ACM
14 years 28 days ago
Static control-flow analysis for reverse engineering of UML sequence diagrams
UML sequence diagrams are commonly used to represent the interactions among collaborating objects. Reverse-engineered sequence diagrams are constructed from existing code, and hav...
Atanas Rountev, Olga Volgin, Miriam Reddoch