Sciweavers

16666 search results - page 19 / 3334
» Descriptive and Computational Complexity
Sort
View
CIKM
2010
Springer
13 years 8 months ago
Yes we can: simplex volume maximization for descriptive web-scale matrix factorization
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
Christian Thurau, Kristian Kersting, Christian Bau...
ICCV
1999
IEEE
14 years 2 months ago
Robust Estimation of Curvature Information from Noisy 3D Data for Shape Description
We describe an effective and novel approach to infer sign and direction of principal curvatures at each input site from noisy 3D data. Unlike most previous approaches, no local su...
Chi-Keung Tang, Gérard G. Medioni
SENSYS
2006
ACM
14 years 3 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
ICCSA
2003
Springer
14 years 3 months ago
Information Extraction to Generate Visual Simulations of Car Accidents from Written Descriptions
This paper describes a system to create animated 3D scenes of car accidents from written reports. The text-to-scene conversion process consists of two stages. An information extrac...
Pierre Nugues, Sylvain Dupuy, Arjan Egges
CCGRID
2005
IEEE
14 years 3 months ago
Efficient resource description and high quality selection for virtual grids
Simple resource specification, resource selection, and effective binding are critical capabilities for Grid middleware. We the Virtual Grid, an abstraction for dynamic grid applic...
Yang-Suk Kee, D. Logothetis, Richard Y. Huang, Hen...