1099 search results - page 172 / 220 » On the Complexity of Computing Evolutionary Trees |
161
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
DIS
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in su...