Sciweavers

2780 search results - page 545 / 556
» Effective features of algorithm visualizations
Sort
View
HASKELL
2009
ACM
14 years 2 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
GLOBECOM
2008
IEEE
14 years 2 months ago
Low-Complexity Hybrid QRD-MCMC MIMO Detection
In this paper, we propose a novel hybrid QRD-MCMC MIMO detector that combines the feature of a QRD-M detector and a Markov chain Monte Carlo (MCMC) detector. The QRD-M algorithm i...
Ronghui Peng, Koon Hoo Teo, Jinyun Zhang, Rong-Ron...
INFOCOM
2007
IEEE
14 years 1 months ago
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, ...
KES
2007
Springer
14 years 1 months ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze