Sciweavers

739 search results - page 109 / 148
» Sorting Algorithms
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 7 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
MIR
2004
ACM
101views Multimedia» more  MIR 2004»
14 years 1 months ago
Leveraging face recognition technology to find and organize photos
With digital still cameras, users can easily collect thousands of photos. We have created a photo management application with the goal of making photo organization and browsing si...
Andreas Girgensohn, John Adcock, Lynn Wilcox
BMCBI
2007
112views more  BMCBI 2007»
13 years 7 months ago
PFAAT version 2.0: A tool for editing, annotating, and analyzing multiple sequence alignments
Background: By virtue of their shared ancestry, homologous sequences are similar in their structure and function. Consequently, multiple sequence alignments are routinely used to ...
Daniel R. Caffrey, Paul H. Dana, Vidhya Mathur, Ma...
IOR
2007
106views more  IOR 2007»
13 years 7 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker