Sciweavers

2957 search results - page 490 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ISCAS
2005
IEEE
167views Hardware» more  ISCAS 2005»
14 years 1 months ago
Low-power log-MAP turbo decoding based on reduced metric memory access
Due to the powerful error correcting performance, turbo codes have been adopted in many wireless communication standards. Although several low-power techniques have been proposed,...
Dong-Soo Lee, In-Cheol Park
SIBGRAPI
2005
IEEE
14 years 1 months ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
VISUALIZATION
2005
IEEE
14 years 1 months ago
Framework for Visualizing Higher-Order Basis Functions
Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions ...
William J. Schroeder, François Bertel, Math...
WACV
2005
IEEE
14 years 1 months ago
Learning to Track Objects Through Unobserved Regions
As tracking systems become more effective at reliably tracking multiple objects over extended periods of time within single camera views and across overlapping camera views, incre...
Chris Stauffer
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind