Sciweavers

1220 search results - page 136 / 244
» Restricting grammatical complexity
Sort
View
JAC
2008
13 years 9 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
MICCAI
2004
Springer
14 years 8 months ago
Enhancement of Visual Realism with BRDF for Patient Specific Bronchoscopy Simulation
Abstract. This paper presents a novel method for photorealistic rendering of the bronchial lumen by directly deriving matched shading and texture parameters from video bronchoscope...
Adrian James Chung, Fani Deligianni, Pallav Shah, ...
ICDT
2009
ACM
143views Database» more  ICDT 2009»
14 years 8 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
HPCA
2009
IEEE
14 years 8 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...