Sciweavers

5499 search results - page 54 / 1100
» Generalized Rewrite Theories
Sort
View
TPLP
2008
89views more  TPLP 2008»
13 years 7 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
FORTE
2010
13 years 9 months ago
Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, ...
MM
1996
ACM
168views Multimedia» more  MM 1996»
13 years 12 months ago
Do Story Agents Use Rocking Chairs? The Theory and Implementation of One Model for Computational Narrative
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
Kevin M. Brooks
WIDM
2003
ACM
14 years 29 days ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
TIT
2010
94views Education» more  TIT 2010»
13 years 2 months ago
Rewriting codes for joint information storage in flash memories
Abstract--Memories whose storage cells transit irreversibly between states have been common since the start of the data storage technology. In recent years, flash memories have bec...
Anxiao Jiang, Vasken Bohossian, Jehoshua Bruck