Sciweavers

845 search results - page 23 / 169
» Connecting Many-Sorted Theories
Sort
View
NIPS
2001
13 years 9 months ago
Generating velocity tuning by asymmetric recurrent connections
Asymmetric lateral connections are one possible mechanism that can account for the direction selectivity of cortical neurons. We present a mathematical analysis for a class of the...
Xiaohui Xie, Martin A. Giese
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
EUROPAR
2004
Springer
14 years 1 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
LANC
2009
ACM
178views Education» more  LANC 2009»
14 years 1 months ago
A connection level model for IEEE 802.11 cells
We study a wireless network under the 802.11 random access protocol, supporting multiple physical layer rates. Based on models for the effective packet rates achieved at the MAC ...
Andrés Ferragut, Fernando Paganini
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 8 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002