2475 search results - page 362 / 495 » On the accuracy of language trees |
ADC
2003
Springer
14 years 1 months ago
2003
Springer
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much r...
NOMS
2002
IEEE
14 years 28 days ago
2002
IEEE
The management of policies in large-scale systems is complex because of the potentially large number of policies and administrators, as well as the diverse types of information th...
ICALP
2010
Springer
14 years 24 days ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
ICALP
2001
Springer
14 years 14 days ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
ICALP
1994
Springer
14 years 2 days ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...