779 search results - page 89 / 156 » Algorithms for the Sample Mean of Graphs |
148
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
132
Voted
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Timing synchronization is a preeminent challenge in ultra-wideband impulse radios (UWB-IRs). The conventional all-digital synchronization methods encounter some formidable impl...
151
click to vote
TVCG
2008
15 years 4 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
141
Voted
CASC
2007
Springer
15 years 10 months ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
142
click to vote
ACL
2006
15 years 6 months ago
2006
We introduce the possibility of combining lexical association measures and present empirical results of several methods employed in automatic collocation extraction. First, we pre...