5606 search results - page 632 / 1122 » Randomization Techniques for Graphs. |
182
click to vote
ESSOS
2010
Springer
16 years 3 months ago
2010
Springer
Information flow control systems provide the guarantees that are required in today’s security-relevant systems. While the literature has produced a wealth of techniques to ensur...
183
click to vote
WALCOM
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
187
click to vote
CSE
2009
IEEE
16 years 1 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...
229
click to vote
ISDA
2009
IEEE
16 years 1 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
153
click to vote
JSSPP
2009
Springer
16 years 1 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...