3268 search results - page 589 / 654 » The hub number of a graph |
102
click to vote
TIP
1998
14 years 11 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
In recent years, a number of projects have turned to Wikipedia to establish large-scale taxonomies that describe orders of magnitude more entities than traditional manually built ...
115
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
101
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...
JCO
2010
14 years 10 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...