736 search results - page 139 / 148 » High-order functions and their ordering relations |
232
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
195
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Caenorhabditis elegans gene-based phenotype information dates back to the 1970’s, beginning with Sydney Brenner and the characterization of behavioral and morphologi...
307
click to vote
PADL
2009
Springer
16 years 6 months ago
2009
Springer
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
168
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
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...
162
click to vote
LCTRTS
2007
Springer
16 years 4 days ago
2007
Springer
The run-time performance of VLIW (very long instruction word) microprocessors depends heavily on the effectiveness of its associated optimizing compiler. Typical VLIW compiler pha...