Sciweavers

328 search results - page 25 / 66
» Algorithms for the edge-width of an embedded graph
Sort
View
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 5 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 5 months ago
Information Preserving XML Schema Embedding
A fundamental concern of information integration in an XML context is the ability to embed one or more source documents in a target document so that (a) the target document confor...
Philip Bohannon, Wenfei Fan, Michael Flaster, P. P...
LCTRTS
2007
Springer
15 years 5 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
ICASSP
2011
IEEE
14 years 3 months ago
A novel algorithm for occlusions and perspective effects using a 3D object process
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point p...
Ahmed Gamal-Eldin, Xavier Descombes, Josiane Zerub...
JAL
2006
114views more  JAL 2006»
14 years 11 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...