Sciweavers

2711 search results - page 366 / 543
» Mapping sequences by parts
Sort
View
CP
2006
Springer
15 years 10 months ago
The ROOTS Constraint
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
Christian Bessière, Emmanuel Hebrard, Brahi...
FPGA
2006
ACM
117views FPGA» more  FPGA 2006»
15 years 10 months ago
Context-free-grammar based token tagger in reconfigurable devices
In this paper, we present reconfigurable hardware architecture for detecting semantics of streaming data on 1+ Gbps networks. The design leverages on the characteristics of contex...
Young H. Cho, James Moscola, John W. Lockwood
ICANN
1997
Springer
15 years 10 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
DBPL
1991
Springer
66views Database» more  DBPL 1991»
15 years 10 months ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
FLAIRS
2008
15 years 8 months ago
A Novel Prioritization Technique for Solving Markov Decision Processes
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
Jilles Steeve Dibangoye, Brahim Chaib-draa, Abdel-...