Sciweavers

356 search results - page 65 / 72
» A Most General Edge Elimination Polynomial - Thickening of E...
Sort
View
102
Voted
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 17 days ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
MOBIHOC
2008
ACM
15 years 12 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
15 years 9 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
110
Voted
SOSP
2009
ACM
15 years 9 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
IPPS
2009
IEEE
15 years 7 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...