Sciweavers

1232 search results - page 246 / 247
» Digraphs: theory, algorithms and applications
Sort
View
TSP
2010
13 years 2 months ago
Time-delay estimation from low-rate samples: a union of subspaces approach
Time-delay estimation arises in many applications in which a multipath medium has to be identified from pulses transmitted through the channel. Previous methods for time delay reco...
Kfir Gedalyahu, Yonina C. Eldar
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
IJAC
2011
12 years 11 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
WSDM
2012
ACM
296views Data Mining» more  WSDM 2012»
12 years 3 months ago
Inferring social ties across heterogenous networks
It is well known that different types of social ties have essentially different influence between people. However, users in online social networks rarely categorize their contact...
Jie Tang, Tiancheng Lou, Jon M. Kleinberg
SIGIR
2012
ACM
11 years 10 months ago
Top-k learning to rank: labeling, ranking and evaluation
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
Shuzi Niu, Jiafeng Guo, Yanyan Lan, Xueqi Cheng