Sciweavers

2600 search results - page 387 / 520
» Clustering with or without the Approximation
Sort
View
ISCAS
2005
IEEE
167views Hardware» more  ISCAS 2005»
14 years 2 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
SMI
2005
IEEE
140views Image Analysis» more  SMI 2005»
14 years 2 months ago
Interactive Implicit Modeling with Hierarchical Spatial Caching
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...
Ryan Schmidt, Brian Wyvill, Eric Galin
WACV
2005
IEEE
14 years 2 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
KCAP
2005
ACM
14 years 2 months ago
Indirect anaphora resolution as semantic path search
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
James Fan, Ken Barker, Bruce W. Porter
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 2 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek