79 search results - page 12 / 16 » A New Reduction from 3SAT to n-Partite Graphs |
102
click to vote
FOCS
2009
IEEE
15 years 6 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...
SIROCCO
2004
15 years 1 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
96
Voted
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
106
click to vote
EDBT
2006
ACM
15 years 11 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
91
Voted
DAC
2003
ACM
16 years 18 days ago
2003
ACM
Many embedded systems use a simple pipelined RISC processor for computation and an on-chip SRAM for data storage. We present an enhancement called Intelligent SRAM (ISRAM) that co...