Sciweavers

2004 search results - page 153 / 401
» Sampling from large graphs
Sort
View
ECCV
2008
Springer
15 years 5 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
122
Voted
PIMRC
2010
IEEE
15 years 1 months ago
Frame delay distribution analysis of IEEE 802.11 networks using Signal Flow Graphs
Frame delay variance in CSMA/CA networks is large. Wireless applications may require both, limited mean delay and limited delay jitter. These parameters can be derived easily from ...
Ralf Jennen, Sebastian Max, Bernhard Walke
ECCV
2010
Springer
15 years 8 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
125
Voted
SIGIR
2003
ACM
15 years 8 months ago
Using manually-built web directories for automatic evaluation of known-item retrieval
Information retrieval system evaluation is complicated by the need for manually assessed relevance judgments. Large manually-built directories on the web open the door to new eval...
Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury...
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...