Sciweavers

1672 search results - page 23 / 335
» Tightness problems in the plane
Sort
View
COMPGEOM
2004
ACM
14 years 29 days ago
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
János Pach, Rom Pinchasi, Micha Sharir
SCA
2007
13 years 10 months ago
Adaptive deformations with fast tight bounds
Simulation of deformations and collision detection are two highly intertwined problems that are often treated separately. This is especially true in existing elegant adaptive simu...
Miguel A. Otaduy, Daniel Germann, Stephane Redon, ...
NC
2011
201views Neural Networks» more  NC 2011»
13 years 2 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
ICPP
2007
IEEE
14 years 1 months ago
Tightly-Coupled Multi-Layer Topologies for 3-D NoCs
Three-dimensional Network-on-Chip (3-D NoC) is an emerging research topic exploring the network architecture of 3-D ICs that stack several smaller wafers for reducing wire length ...
Hiroki Matsutani, Michihiro Koibuchi, Hideharu Ama...