1594 search results - page 220 / 319 » An Algorithm to Compute Collusion Paths |
148
Voted
MDM
2009
Springer
15 years 10 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
117
click to vote
WG
2007
Springer
15 years 9 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...
127
click to vote
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are ofte...
118
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
128
click to vote
SPIN
2000
Springer
15 years 7 months ago
2000
Springer
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...