Sciweavers

3656 search results - page 244 / 732
» Compact Location Problems
Sort
View
WIA
2005
Springer
15 years 12 months ago
Minimization of Non-deterministic Automata with Large Alphabets
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Ma...
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
15 years 11 months ago
Semantic representation: search and mining of multimedia content
Semantic understanding of multimedia content is critical in enabling effective access to all forms of digital media data. By making large media repositories searchable, semantic ...
Apostol Natsev, Milind R. Naphade, John R. Smith
ASP
2003
Springer
15 years 11 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 11 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
15 years 11 months ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak