1594 search results - page 190 / 319 » An Algorithm to Compute Collusion Paths |
133
Voted
NIPS
2003
15 years 4 months ago
2003
The standard 2-norm SVM is known for its good performance in twoclass classi£cation. In this paper, we consider the 1-norm SVM. We argue that the 1-norm SVM may have some advanta...
122
click to vote
MICCAI
2009
Springer
16 years 4 months ago
2009
Springer
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
130
Voted
CCCG
2007
15 years 5 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
144
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
136
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...