Sciweavers

6365 search results - page 451 / 1273
» Fast Local Computation Algorithms
Sort
View
TSP
2008
113views more  TSP 2008»
15 years 7 months ago
Avoiding Divergence in the Shalvi-Weinstein Algorithm
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
16 years 15 days ago
DEEP: Dual-Space Expansion for Estimating Penetration Depth Between Convex Polytopes
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
Young J. Kim, Ming C. Lin, Dinesh Manocha
252
Voted
BMCBI
2010
198views more  BMCBI 2010»
15 years 7 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
MOBIDE
2005
ACM
16 years 1 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
CVPR
2007
IEEE
16 years 9 months ago
Filtered Component Analysis to Increase Robustness to Local Minima in Appearance Models
Appearance Models (AM) are commonly used to model appearance and shape variation of objects in images. In particular, they have proven useful to detection, tracking, and synthesis...
Fernando De la Torre, Alvaro Collet, Manuel Quero,...