Sciweavers

344 search results - page 52 / 69
» The Directed Minimum Latency Problem
Sort
View
DM
1999
145views more  DM 1999»
14 years 9 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
14 years 4 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto
ISCA
1996
IEEE
130views Hardware» more  ISCA 1996»
15 years 1 months ago
Informing Memory Operations: Providing Memory Performance Feedback in Modern Processors
Memory latency is an important bottleneck in system performance that cannot be adequately solved by hardware alone. Several promising software techniques have been shown to addres...
Mark Horowitz, Margaret Martonosi, Todd C. Mowry, ...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 2 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
EUSFLAT
2007
14 years 11 months ago
Recent Advances in the Field of Left-continuous t-norms
The recent advances in the research of left-continuous t-norms is summarized in this talk. The main focus is on construction methods, geometric description, and structural charact...
Sándor Jenei