Sciweavers

4926 search results - page 598 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
207
Voted
ICCV
2011
IEEE
14 years 1 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
119
Voted
SIGGRAPH
1991
ACM
15 years 6 months ago
Visibility preprocessing for interactive walkthroughs
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
Seth J. Teller, Carlo H. Séquin
BMCBI
2006
120views more  BMCBI 2006»
15 years 2 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
100
Voted
DIS
2007
Springer
15 years 8 months ago
Discovering Communicable Models from Earth Science Data
Abstract. This chapter describes how we used regression rules to improve upon results previously published in the Earth science literature. In such a scientific application of mac...
Mark Schwabacher, Pat Langley, Christopher Potter,...
127
Voted
ENDM
2006
77views more  ENDM 2006»
15 years 2 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...