1594 search results - page 154 / 319 » An Algorithm to Compute Collusion Paths |
113
Voted
VLSID
2001
IEEE
16 years 3 months ago
2001
IEEE
Development of the process technology for dual threshold (dual Vth ) CMOS circuit has opened up the possibility of using it to reduce static power in low voltage high performance ...
116
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
116
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
130
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
118
Voted
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
— We introduce a hierarchical variant of the probabilistic roadmap method for motion planning. By recursively refining an initially sparse sampling in neighborhoods of the C-obs...