Sciweavers

16404 search results - page 3009 / 3281
» A set coverage problem
Sort
View
137
Voted
ELPUB
1999
ACM
15 years 9 months ago
Online Publishing as a Support for Scholarly Communication in Dynamic Knowledge Communities
Internet based services, particularly asynchronous communication services, offer an environment suited to the rise of knowledge communities. Knowledge communities, or invisible co...
Ana Alice Baptista, Elóy Rodrigues, Altamir...
277
Voted
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 9 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
164
Voted
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 9 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
146
Voted
INFOCOM
1999
IEEE
15 years 9 months ago
Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
Isabella Chang, Robert Engel, Dilip D. Kandlur, Di...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 9 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
« Prev « First page 3009 / 3281 Last » Next »