Sciweavers

2022 search results - page 262 / 405
» Complexity of Non-Monotonic Logics
Sort
View
ICPR
2008
IEEE
16 years 26 days ago
A new method to obtain the shift-table in Boyer-Moore's string matching algorithm
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
Yang Wang
FUZZIEEE
2007
IEEE
16 years 23 days ago
Optimised Generalised Type-2 Join and Meet Operations
— The inferencing stage of a type-2 fuzzy inferencing system is driven by join and meet operations. As conventionally implemented these algorithms are computationally complex. Th...
Sarah Greenfield, Robert John
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
16 years 22 days ago
Stream Variables: A Quick but not Dirty SQL Extension for Continuous Queries
The ability to query data streams is of increasing importance and has been identified as a crucial element for modern organizations and agencies. This paper identifies a class o...
Damianos Chatziantoniou, Yannis Sotiropoulos
IRI
2007
IEEE
16 years 21 days ago
A Conceptual Data Model for the Architecture Exploration of Automotive Distributed Embedded Architectures
As design complexities increase exponentially, automotive designers need integrated tool environments enabling system-level analyses of alternative architectural solutions. Hence,...
Paolo Giusto, Sri Kanajan, Claudio Pinello, Max Ch...
SEMCO
2007
IEEE
16 years 21 days ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth