• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 5 of 5

On the Power of finite automata with both nondeterministic and probabilistic states

by Anne Condon, Samuel Pottle, Lisa Hellerstein, Avi Wigderson - Proc. of the Twenty Sixth Annual ACM Symposium on Theory of Computing , 1994
"... We study finite automata with both nondeterministic and random states (npfa’s). We restrict our attention to those npfa’s that accept their languages with a small probability of error and run in polynomial expected time. Equivalently, we study Arthur-Merlin games where Arthur is limited to polynomia ..."
Abstract - Cited by 14 (0 self) - Add to MetaCart
We study finite automata with both nondeterministic and random states (npfa’s). We restrict our attention to those npfa’s that accept their languages with a small probability of error and run in polynomial expected time. Equivalently, we study Arthur-Merlin games where Arthur is limited

SIMULATION, DEVELOPMENT AND DEPLOYMENT OF MOBILE WIRELESS SENSOR NETWORKS FOR MIGRATORY BIRD TRACKING

by Bird Tracking, William P. Bennett, William P., Development, Deployment Of, Mobile Wireless Sensor, William P. Bennett, William P. Bennett, Adviser Mehmet, C. Vuran , 2012
"... This thesis presents CraneTracker, a multi-modal sensing and communication system for monitoring migratory species at the continental level. By exploiting the robust and extensive cellular infrastructure across the continent, traditional mobile wireless sensor networks can be extended to enable reli ..."
Abstract - Add to MetaCart
This thesis presents CraneTracker, a multi-modal sensing and communication system for monitoring migratory species at the continental level. By exploiting the robust and extensive cellular infrastructure across the continent, traditional mobile wireless sensor networks can be extended to enable reliable, low-cost monitoring of migratory species. The developed multi-tier architecture yields ecologists with unconventional behavior in-formation not furnished by alternative tracking systems at such a large scale and for a low-cost. The simulation, development and implementation of the CraneTracker soft-ware system is presented. The system is shown effective through multiple proxy deploy-

Query Evaluation with Constant Delay

by Thèse De Doctorat, Normale Supérieure, De Cachan, Présentée Par, Monsieur Wojciech Kazana, Docteur De, Supérieure De Cachan, Nicole Bidoit, Professeur Président, Arnaud Durand, Patrice Ossona, Mendez Chargé, Victor Vianu, Professeur Examinateur, Luc Segoufin, Directeur Recherche Directeur
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract - Add to MetaCart
for discussions and advice. I would like to thank Arnaud Durand and Patrice Ossona de Mendez for accepting to review this thesis and for their constructive comments on the earlier versions of this manuscript. Many thanks to Nicole Bidoit and Victor Vianu for accepting to be in my jury. Special thanks go to my

Chapter 12 Rough Sets and Rough Logic: A KDD Perspective

by Zdzis Law Pawlak, Lech Polkowski, Andrzej Skowron
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract - Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.

3esis Supervisor Accepted by

by Audio-based Localisation, Benjamin Christopher Dalton, V. Michael, Benjamin Christopher Dalton , 2005
"... in partial ful2llment of the requirements for the degree of ..."
Abstract - Add to MetaCart
in partial ful2llment of the requirements for the degree of
Results 1 - 5 of 5
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University