1538 search results - page 200 / 308 » Spectral Techniques in Graph Algorithms |
109
click to vote
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
JSSPP
2009
Springer
15 years 8 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
SMC
2007
IEEE
15 years 7 months ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
122
click to vote
LPAR
2005
Springer
15 years 7 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
115
click to vote
JCP
2008
15 years 1 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...