Sciweavers

2063 search results - page 85 / 413
» connection 2007
Sort
View
IPL
2007
96views more  IPL 2007»
14 years 11 months ago
Fault diameter of product graphs
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
Jun-Ming Xu, Chao Yang
CCCG
2004
15 years 13 days ago
On the number of line tangents to four triangles in three-dimensional space
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
Hervé Brönnimann, Olivier Devillers, S...
JUCS
2007
75views more  JUCS 2007»
14 years 11 months ago
RE-AspectLua - Achieving Reuse in AspectLua
: AspectLua is a Lua-based dynamic aspect-oriented language that follows the original AspectJ concepts. It suffers from the same problem of AspectJ-like languages with regard to li...
Thaís Vasconcelos Batista, Maurício ...
JSAC
2007
83views more  JSAC 2007»
14 years 11 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia
NIPS
1997
15 years 11 days ago
Multi-modular Associative Memory
Recent imaging studies suggest that object knowledge is stored in the brain as a distributed network of many cortical areas. Motivated by these observations, we study a multi-modu...
Nir Levy, David Horn, Eytan Ruppin