2877 search results - page 183 / 576 » The Complexity of Planarity Testing |
124
click to vote
JPDC
2010
15 years 3 months ago
2010
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
132
click to vote
SIGCOMM
2012
ACM
13 years 7 months ago
2012
ACM
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
152
Voted
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
153
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
145
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...