Sciweavers

270 search results - page 31 / 54
» Properties of Almost All Graphs and Generalized Quantifiers
Sort
View
SGP
2007
14 years 5 days ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
FOCS
2006
IEEE
14 years 3 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
TOOLS
2009
IEEE
14 years 4 months ago
Early Crosscutting Metrics as Predictors of Software Instability
Many researchers claim that crosscutting concerns, which emerge in early software development stages, are harmful to software stability. On the other hand, there is a lack of effec...
José María Conejero, Eduardo Figueir...
NN
2007
Springer
13 years 9 months ago
Edge of chaos and prediction of computational performance for neural circuit models
We analyze in this article the significance of the edge of chaos for real-time computations in neural microcircuit models consisting of spiking neurons and dynamic synapses. We ...
Robert A. Legenstein, Wolfgang Maass
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
14 years 3 months ago
VLSI CAD tool protection by birthmarking design solutions
Many techniques have been proposed in the past for the protection of VLSI design IPs (intellectual property). CAD tools and algorithms are intensively used in all phases of modern...
Lin Yuan, Gang Qu, Ankur Srivastava