Sciweavers

1664 search results - page 236 / 333
» Distance labeling in graphs
Sort
View
CORR
2007
Springer
91views Education» more  CORR 2007»
15 years 4 months ago
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
Junsheng Han, Paul H. Siegel, Ron M. Roth
CVIU
2007
112views more  CVIU 2007»
15 years 4 months ago
Pedestrian detection and tracking in infrared imagery using shape and appearance
In this paper, we present an approach toward pedestrian detection and tracking from infrared imagery using joint shape and appearance cues. A layered representation is first intr...
Congxia Dai, Yunfei Zheng, Xin Li
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 5 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
ISLPED
1997
ACM
108views Hardware» more  ISLPED 1997»
15 years 8 months ago
Techniques for low energy software
The energy consumption of a system depends upon the hardware and software component of a system. Since it is the software which drives the hardware in most systems, decisions take...
Huzefa Mehta, Robert Michael Owens, Mary Jane Irwi...
IAT
2008
IEEE
15 years 11 months ago
Quantum Service Selection
Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational s...
Matthias Klusch, René Schubotz