Sciweavers

3708 search results - page 487 / 742
» Approximating Betweenness Centrality
Sort
View
TWC
2010
15 years 1 months ago
Impact of mobile node density on detection performance measures in a hybrid sensor network
We investigate the impact of mobile node density on several detection performance measures for stationary target detection by a hybrid sensor network consisting of both static and ...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
ICASSP
2011
IEEE
14 years 10 months ago
Driver risk evaluation based on acceleration, deceleration, and steering behavior
We propose a driver risk evaluation method based on the analysis of driving data captured with drive recorders. To evaluate the acceleration behavior of each driver we plot the ma...
Chiyomi Miyajima, Hiroki Ukai, Atsumi Naito, Hideo...
ICCV
2011
IEEE
14 years 6 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
CVPR
2012
IEEE
13 years 9 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
ECCC
2007
147views more  ECCC 2007»
15 years 6 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...