Sciweavers

6365 search results - page 481 / 1273
» Fast Local Computation Algorithms
Sort
View
MOBISYS
2011
ACM
14 years 10 months ago
Indoor localization without infrastructure using the acoustic background spectrum
We introduce a new technique for determining a mobile phone’s indoor location even when Wi-Fi infrastructure is unavailable or sparse. Our technique is based on a new ambient so...
Stephen P. Tarzia, Peter A. Dinda, Robert P. Dick,...
NIPS
2004
15 years 9 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
TMI
2010
208views more  TMI 2010»
15 years 2 months ago
Patient-Specific Modeling and Quantification of the Aortic and Mitral Valves From 4-D Cardiac CT and TEE
As decisions in cardiology increasingly rely on non-invasive methods, fast and precise image processing tools have become a crucial component of the analysis workflow. To the best ...
Razvan Ioan Ionasec, Ingmar Voigt, Bogdan Georgesc...
CVPR
1998
IEEE
16 years 9 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
PVLDB
2008
154views more  PVLDB 2008»
15 years 7 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing