Sciweavers

835 search results - page 149 / 167
» Exploiting web search engines to search structured databases
Sort
View
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
124
Voted
SEMWEB
2004
Springer
15 years 3 months ago
SemanticOrganizer: A Customizable Semantic Repository for Distributed NASA Project Teams
SemanticOrganizer is a collaborative knowledge management system designed to support distributed NASA projects, including multidisciplinary teams of scientists, engineers, and acci...
Richard M. Keller, Daniel C. Berrios, Robert E. Ca...
CSC
2008
14 years 11 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
IUI
2009
ACM
15 years 6 months ago
You can play that again: exploring social redundancy to derive highlight regions in videos
Identifying highlights in multimedia content such as video and audio is currently a very difficult technical problem. We present and evaluate a novel algorithm that identifies hig...
Jose San Pedro, Vaiva Kalnikaité, Steve Whi...
VLDB
1990
ACM
128views Database» more  VLDB 1990»
15 years 1 months ago
Advanced Query Processing in Object Bases Using Access Support Relations
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...
Alfons Kemper, Guido Moerkotte