4171 search results - page 580 / 835 » Choice numbers of graphs |
176
click to vote
COLT
2007
Springer
16 years 25 days ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
156
click to vote
KES
2007
Springer
16 years 24 days ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
167
click to vote
TCC
2007
Springer
16 years 23 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
146
click to vote
WABI
2007
Springer
16 years 23 days ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
184
click to vote
ICDM
2006
IEEE
16 years 21 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...