2063 search results - page 85 / 413 » connection 2007 |
108
click to vote
IPL
2007
15 years 3 months ago
2007
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...
137
click to vote
CCCG
2004
15 years 5 months ago
2004
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...
128
click to vote
JUCS
2007
15 years 3 months ago
2007
: 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...
125
click to vote
JSAC
2007
15 years 3 months ago
2007
— 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 ...
136
click to vote
NIPS
1997
15 years 5 months ago
1997
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...