Sciweavers

736 search results - page 74 / 148
» A Science of Reasoning (Extended Abstract)
Sort
View
JMIV
2008
94views more  JMIV 2008»
13 years 9 months ago
Measuring Elongation from Shape Boundary
Abstract Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is the reason for its applicability in many shape classification tasks...
Milos Stojmenovic, Jovisa D. Zunic
CC
2011
Springer
267views System Software» more  CC 2011»
13 years 17 days ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
GG
2004
Springer
14 years 2 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
STACS
2007
Springer
14 years 3 months ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
TLCA
1993
Springer
14 years 1 months ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli