Sciweavers

2553 search results - page 305 / 511
» Modeling Trees with Hypertextures
Sort
View
125
Voted
WG
2007
Springer
15 years 9 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
SKG
2006
IEEE
15 years 9 months ago
Viewpoint Tour Mechanism Based on Resource Space View
Based on the Resource Space Model, this paper proposes a view mechanism for finding and reusing legacy Resource Spaces according to users’ idiosyncratic resource interests. It e...
Jin Liu
STACS
2005
Springer
15 years 9 months ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
ICGI
1998
Springer
15 years 8 months ago
Meaning Helps Learning Syntax
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
Isabelle Tellier
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
15 years 7 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu