Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Abstract. The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was pr...
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...