10412 search results - page 1828 / 2083 » The efficiency of algorithms - misconceptions |
143
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
133
click to vote
COMCOM
2008
15 years 5 months ago
2008
In this paper, we address the rate control, the Medium Access Control (MAC) and the routing problem for cooperative Vehicular Ad-Hoc Network (VANET) in the framework of cross-laye...
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
132
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
114
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same pro...