Sciweavers

1594 search results - page 206 / 319
» Visualizing Program Executions on Large Data Sets
Sort
View
POPL
2008
ACM
16 years 3 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
SIAMIS
2010
378views more  SIAMIS 2010»
14 years 10 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
130
Voted
RECOMB
2006
Springer
16 years 3 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
DILS
2008
Springer
15 years 5 months ago
VisGenome and Ensembl: Usability of Integrated Genome Maps
It is not always clear how best to represent integrated data sets, and which application and database features allow a scientist to take best advantage of data coming from various ...
Joanna Jakubowska, Ela Hunt, John McClure, Matthew...
119
Voted
ICIP
2002
IEEE
16 years 4 months ago
DPF - a perceptual distance function for image retrieval
For almost a decade, Content-Based Image Retrieval has been an active research area, yet one fundamental problem remains largely unsolved: how to measure perceptual similarity. To...
Baitao Li Chang, E. Ching-Tung Wu