Sciweavers

1154 search results - page 171 / 231
» On the editing distance of graphs
Sort
View
INFOCOM
2003
IEEE
14 years 2 months ago
Localized minimum-energy broadcasting in ad-hoc networks
— In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from...
Julien Cartigny, David Simplot, Ivan Stojmenovic
FOCS
2004
IEEE
14 years 18 days 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»
13 years 8 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»
13 years 8 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
CCGRID
2009
IEEE
14 years 3 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...