Sciweavers

720 search results - page 85 / 144
» Linear k-arboricities on trees
Sort
View
JOLLI
2010
106views more  JOLLI 2010»
13 years 7 months ago
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Makoto Kanazawa
CASES
2010
ACM
13 years 6 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
ISBI
2011
IEEE
13 years 14 days ago
Reliable cell tracking by global data association
Automated cell tracking in populations is important for research and discovery in biology and medicine. In this paper, we propose a cell tracking method based on global spatiotemp...
Ryoma Bise, Zhaozheng Yin, Takeo Kanade
PODS
2007
ACM
107views Database» more  PODS 2007»
14 years 9 months ago
Polynomial time fragments of XPath with variables
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot...
LATIN
2010
Springer
14 years 3 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer