461 search results - page 80 / 93 » Uniform Operators |
113
click to vote
SCP
1998
14 years 9 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
174
click to vote
FAST
2011
14 years 1 months ago
2011
Previous approaches to RAID scaling either require a very large amount of data to be migrated, or cannot tolerate multiple disk additions without resulting in disk imbalance. In t...
SODA
2012
ACM
13 years 10 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
WEBI
2001
Springer
15 years 2 months ago
2001
Springer
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
JACM
2007
14 years 9 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...