Sciweavers

1670 search results - page 125 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
133
Voted
ICCV
2003
IEEE
15 years 8 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
BMCBI
2004
111views more  BMCBI 2004»
15 years 3 months ago
Multiclass discovery in array data
Background: A routine goal in the analysis of microarray data is to identify genes with expression levels that correlate with known classes of experiments. In a growing number of ...
Yingchun Liu, Markus Ringnér
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
15 years 7 months ago
Cache conscious programming in undergraduate computer science
The wide-spread use of microprocessor based systems that utilize cache memory to alleviate excessively long DRAM access times introduces a new dimension in the quest to obtain goo...
Alvin R. Lebeck
ICDCS
2012
IEEE
13 years 5 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
TVCG
2008
109views more  TVCG 2008»
15 years 3 months ago
Rapid Graph Layout Using Space Filling Curves
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
Chris Muelder, Kwan-Liu Ma