Sciweavers

109 search results - page 16 / 22
» Computing the betti numbers of arrangements
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
NOCS
2007
IEEE
14 years 2 months ago
QNoC Asynchronous Router with Dynamic Virtual Channel Allocation
An asynchronous router for QNoC (Quality-of service NoC) is presented. It combines multiple service levels (SL) with multiple equal-priority virtual channels (VC) within each leve...
Rostislav (Reuven) Dobkin, Ran Ginosar, Israel Cid...
CVPR
2010
IEEE
14 years 2 days ago
Person Re-Identification by Symmetry-Driven Accumulation of Local Features
In this paper, we present an appearance-based method for person re-identification. It consists in the extraction of features that model three complementary aspects of the human ap...
Michela Farenzena, Loris Bazzani, Alessandro Perin...
IPPS
1999
IEEE
14 years 22 hour ago
Segment Directory Enhancing the Limited Directory Cache Coherence Schemes
We present a new arrangement of directory bits called the segment directory to improve directory storage efficiency: a segment directory can point to several sharing processors wi...
Jong Hyuk Choi, Kyu Ho Park
ACSC
2008
IEEE
13 years 9 months ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish