Sciweavers

2373 search results - page 36 / 475
» Complexities for generalized models of self-assembly
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 4 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
PASTE
2005
ACM
15 years 9 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
117
Voted
CARTOGRAPHICA
2010
109views more  CARTOGRAPHICA 2010»
15 years 1 months ago
Automated Reduction of Visual Complexity in Small-Scale Relief Shading
Shaded relief derived automatically from digital elevation models differs distinctly from traditional manual shading. Particularly at small scales, many small topographic details ...
Anna M. Leonowicz, Bernhard Jenny, Lorenz Hurni
CIKM
2009
Springer
15 years 10 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
WG
2004
Springer
15 years 9 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...