1327 search results - page 260 / 266 » Path following algorithm for the graph matching problem |
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
87
Voted
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
NETWORK
2007
14 years 9 months ago
2007
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
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 ...
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...