Sciweavers

815 search results - page 107 / 163
» Approximate Entropy Reducts
Sort
View
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
15 years 6 months ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
COCOON
2005
Springer
15 years 5 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
15 years 5 months ago
Evolutionary algorithms for medical simulations: a case study in minimally-invasive vascular interventions
To obtain the expertise to correctly perform minimally– invasive vascular interventions thorough training is required. Training using simulation systems are increasingly becomin...
Peter A. N. Bosman, Tanja Alderliesten
PARA
2004
Springer
15 years 5 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
VLSID
1993
IEEE
133views VLSI» more  VLSID 1993»
15 years 4 months ago
An Area-Efficient Systolic Architecture for Real-Time VLSI Finite Impulse Response Filters
An area-eficzent systolic architecture for realtime, programmable-coeBcient jinite impulse response (FIR)filters is presented. A technique called pipelined clustering is introduce...
V. Visvanathan, Nibedita Mohanty, S. Ramanathan