Sciweavers

666 search results - page 44 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 10 months ago
Corpus-based Schema Matching
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, ...
QUESTA
2010
112views more  QUESTA 2010»
13 years 7 months ago
Admission control for a multi-server queue with abandonment
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...
Yasar Levent Koçaga, Amy R. Ward
PAKDD
2010
ACM
198views Data Mining» more  PAKDD 2010»
14 years 1 months ago
A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods
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...
Chen-Yi Lin, Jia-Ling Koh, Arbee L. P. Chen
ITCC
2000
IEEE
14 years 1 months ago
Parallel Real-Time Numerical Computation: Beyond Speedup III
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...
Selim G. Akl, Stefan D. Bruda
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 9 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir