Sciweavers

305 search results - page 42 / 61
» Preference and Non-deterministic Choice
Sort
View
102
Voted
BMCBI
2004
143views more  BMCBI 2004»
14 years 9 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
MLQ
2000
99views more  MLQ 2000»
14 years 9 months ago
Von Rimscha's Transitivity Conditions
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
Paul E. Howard, Jean E. Rubin, Adrienne Stanley
ICCV
2001
IEEE
15 years 11 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
15 years 11 months ago
Parallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rod...
GIS
2007
ACM
15 years 10 months ago
Optimal route selection with route planners: results of a desktop usability study
Route planners request user input about preferred route characteristics in order to provide the user with the optimal route. Although navigators have a general idea about what con...
Hartwig H. Hochmair