3008 search results - page 409 / 602 » Independence in connected graphs |
180
click to vote
FCCM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Single-FPGA spatial implementations can provide an order of magnitude speedup over sequential microprocessor implementations for data-parallel, floating-point computation in SP...
178
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
199
click to vote
SMI
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real world applications are isometric or near is...
184
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
150
click to vote
SIGECOM
2004
ACM
16 years 11 days ago
2004
ACM
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...