Sciweavers

8431 search results - page 1567 / 1687
» Algorithmically Independent Sequences
Sort
View
PVLDB
2010
91views more  PVLDB 2010»
14 years 8 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
TKDE
2010
153views more  TKDE 2010»
14 years 8 months ago
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Viviana Mascardi, Angela Locoro, Paolo Rosso
GROUP
2010
ACM
14 years 8 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
IPPS
2010
IEEE
14 years 8 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb
SIGMOD
2010
ACM
199views Database» more  SIGMOD 2010»
14 years 7 months ago
Keyword search across databases and documents
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
Carlos Garcia-Alvarado, Carlos Ordonez
« Prev « First page 1567 / 1687 Last » Next »