1538 search results - page 204 / 308 » Spectral Techniques in Graph Algorithms |
116
Voted
ICDM
2005
IEEE
15 years 7 months ago
2005
IEEE
Recommendation algorithms aim at proposing “next” pages to a user based on her current visit and the past users’ navigational patterns. In the vast majority of related algor...
121
click to vote
AOSD
2007
ACM
15 years 5 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
126
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
120
click to vote
KDD
2006
ACM
16 years 1 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
129
click to vote
GLOBECOM
2010
IEEE
14 years 11 months ago
2010
IEEE
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...