Sciweavers

4743 search results - page 123 / 949
» The PlusCal Algorithm Language
Sort
View
191
Voted
ICALP
1995
Springer
15 years 6 months ago
Intervalizing k-Colored Graphs
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
Hans L. Bodlaender, Babette de Fluiter
CICLING
2008
Springer
15 years 4 months ago
Mixing Statistical and Symbolic Approaches for Chemical Names Recognition
This paper investigates the problem of automatic chemical Term Recognition (TR) and proposes to tackle the problem by fusing Symbolic and statistical techniques. Unlike other solut...
Florian Boudin, Juan Manuel Torres Moreno, Marc El...
ICNC
2005
Springer
15 years 8 months ago
A Natural Language Watermarking Based on Chinese Syntax
Abstract. A novel text watermarking algorithm is presented. It combines natural language watermarking and Chinese syntax based on BP neural networks. Since the watermarking signals...
Yuling Liu, Xingming Sun, Yong Wu
TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
15 years 7 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner
ICALP
1994
Springer
15 years 6 months ago
Finding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
Raphael Yuster, Uri Zwick