Sciweavers

530 search results - page 70 / 106
» Universal randomized switching
Sort
View

Publication
335views
13 years 6 months ago
Person Re-Identification: What Features are Important?
State-of-the-art person re-identi cation methods seek robust person matching through combining various feature types. Often, these features are implicitly assigned with a single ve...
Chunxiao Liu, Shaogang Gong, Chen Change Loy, Xing...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
115
Voted
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 7 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
CCCG
2010
15 years 5 months ago
On stretch minimization problem on unit strip paper
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
Ryuhei Uehara
ICCAD
2009
IEEE
128views Hardware» more  ICCAD 2009»
15 years 1 months ago
PCRAMsim: System-level performance, energy, and area modeling for Phase-Change RAM
Phase-change random access memory (PCRAM) is an emerging memory technology with attractive features, such as fast read access, high density, and non-volatility. Because of these a...
Xiangyu Dong, Norman P. Jouppi, Yuan Xie