Sciweavers

1221 search results - page 198 / 245
» Two Consistency Results on Set Mappings
Sort
View
CODES
1999
IEEE
15 years 10 months ago
How standards will enable hardware/software co-design
o much higher levels of abstraction than today's design practices, which are usually at the level of synthesizable RTL for custom hardware or Instruction Set Simulator (ISS) f...
Mark Genoe, Christopher K. Lennard, Joachim Kunkel...
IPPS
1999
IEEE
15 years 10 months ago
Process Networks as a High-Level Notation for Metacomputing
Abstract. Our work involves the development of a prototype Geographical Information System GIS as an example of the use of process networks as a well-de ned high-level semantic mod...
Darren Webb, Andrew L. Wendelborn, Kevin Maciunas
GBRPR
2007
Springer
15 years 10 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal
ICC
2011
IEEE
237views Communications» more  ICC 2011»
14 years 5 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
JGT
2011
109views more  JGT 2011»
15 years 1 months ago
Total weight choosability of graphs
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
Tsai-Lien Wong, Xuding Zhu