Sciweavers

11381 search results - page 1894 / 2277
» Connectivity
Sort
View
CLEIEJ
2010
15 years 4 months ago
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
Sandro Sawicki, Gustavo Wilke, Marcelo O. Johann, ...
COMBINATORICA
2010
15 years 4 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 4 months ago
Simulating space and time
This paper explores the idea that the space-time of a virtual reality could appear to those within it as our space-time does to us. The likely processing needed to do this include...
Brian Whitworth
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 4 months ago
When are feedforward microcircuits well-modeled by maximum entropy methods?
Describing the collective activity of neural populations is a daunting task: the number of possible patterns grows exponentially with the number of cells, resulting in practically...
Andrea K. Barreiro, Julijana Gjorgjieva, Fred Riek...
202
Voted
CPC
2010
117views more  CPC 2010»
15 years 4 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
« Prev « First page 1894 / 2277 Last » Next »