Sciweavers

829 search results - page 143 / 166
» Distance domination-critical graphs
Sort
View
FOCS
2004
IEEE
15 years 3 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
CORR
2007
Springer
91views Education» more  CORR 2007»
14 years 11 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»
14 years 11 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
DM
2008
97views more  DM 2008»
14 years 12 months ago
On uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
Sergey V. Avgustinovich, Sergey Kitaev
SIAMDM
2008
50views more  SIAMDM 2008»
14 years 11 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin