516 search results - page 57 / 104 » Generalizing the Discrete Timed Automaton |
117
click to vote
KDD
2001
ACM
16 years 1 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
109
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
119
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
104
click to vote
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
115
click to vote
ACNS
2005
Springer
15 years 7 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...