Sciweavers

224 search results - page 5 / 45
» Three New Algorithms for Regular Language Enumeration
Sort
View
92
Voted
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 1 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
ENGL
2007
87views more  ENGL 2007»
14 years 9 months ago
Learning of Partial Languages
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
K. Sasikala, V. Rajkumar Dare, D. G. Thomas
JALC
2008
72views more  JALC 2008»
14 years 9 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
ICALP
2007
Springer
15 years 3 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 1 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke