1015 search results - page 12 / 203 » On Information Regularization |
IRI
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over const...
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
106
Voted
EJC
2011
14 years 6 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...
105
click to vote
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...