Sciweavers

7006 search results - page 264 / 1402
» Approximation Algorithms
Sort
View
PG
1999
IEEE
15 years 10 months ago
Mesh Approximation Using a Volume-Based Metric
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and th...
Pierre Alliez, Nathalie Laurent, Henri Sanson, Fra...
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
16 years 21 days ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...
INFOCOM
2003
IEEE
15 years 11 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
CISS
2008
IEEE
16 years 26 days ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
COMPGEOM
2004
ACM
15 years 12 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato