Sciweavers

497 search results - page 78 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
3DPVT
2004
IEEE
149views Visualization» more  3DPVT 2004»
15 years 1 months ago
Fan-Meshes: A Geometric Primitive for Point-Based Description of 3D Models and Scenes
We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approxi...
Xiaotian Yan, Fang Meng, Hongbin Zha
ESANN
2004
14 years 11 months ago
Neural dynamics for task-oriented grouping of communicating agents
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
Jochen J. Steil
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 1 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
15 years 1 months ago
Hip Implant Insertability Analysis: A Medical Instance of the Peg-In-Hole Problem
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
Leo Joskowicz, Russell H. Taylor
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 4 days ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang