Sciweavers

824 search results - page 36 / 165
» Weighted Low-Rank Approximations
Sort
View
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 6 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
SGP
2003
13 years 10 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
Anders Adamson, Marc Alexa
BMCBI
2010
174views more  BMCBI 2010»
13 years 8 months ago
The effect of prior assumptions over the weights in BayesPI with application to study protein-DNA interactions from ChIP-based h
Background: To further understand the implementation of hyperparameters re-estimation technique in Bayesian hierarchical model, we added two more prior assumptions over the weight...
Junbai Wang
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 8 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
14 years 24 days ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang