1538 search results - page 143 / 308 » Spectral Techniques in Graph Algorithms |
143
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
182
Voted
TOG
2012
13 years 6 months ago
2012
Point samples with different spectral noise properties (often defined using color names such as white, blue, green, and red) are important for many science and engineering discip...
119
Voted
AOSD
2006
ACM
15 years 9 months ago
2006
ACM
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
112
Voted
LCTRTS
2004
Springer
15 years 9 months ago
2004
Springer
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
143
Voted
PVLDB
2010
15 years 2 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...