Sciweavers

438 search results - page 84 / 88
» Three Approaches to Probability Model Selection
Sort
View
W2GIS
2004
Springer
14 years 24 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
OOPSLA
2010
Springer
13 years 5 months ago
An input-centric paradigm for program dynamic optimizations
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
Kai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng She...
RSA
2000
170views more  RSA 2000»
13 years 7 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
CVPR
2003
IEEE
14 years 9 months ago
Multi-scale Phase-based Local Features
Local feature methods suitable for image feature based object recognition and for the estimation of motion and structure are composed of two steps, namely the `where' and `wh...
Gustavo Carneiro, Allan D. Jepson
BMCBI
2006
127views more  BMCBI 2006»
13 years 7 months ago
A graph-search framework for associating gene identifiers with documents
Background: One step in the model organism database curation process is to find, for each article, the identifier of every gene discussed in the article. We consider a relaxation ...
William W. Cohen, Einat Minkov