Sciweavers

2570 search results - page 474 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CIKM
2006
Springer
14 years 12 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
CGF
2008
140views more  CGF 2008»
14 years 10 months ago
Interactive Glossy Reflections using GPU-based Ray Tracing with Adaptive LOD
We present an interactive GPU-based algorithm for accurately rendering high-quality, dynamic glossy reflection effects from both HDR environment maps and local scene objects. Our ...
Xuan Yu, Rui Wang 0003, Jingyi Yu
CAL
2007
14 years 10 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
IJRR
2007
104views more  IJRR 2007»
14 years 9 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
SIGGRAPH
1996
ACM
15 years 2 months ago
Fitting Smooth Surfaces to Dense Polygon Meshes
Recent progress in acquiring shape from range data permits the acquisition of seamless million-polygon meshes from physical models. In this paper, we present an algorithm and syst...
Venkat Krishnamurthy, Marc Levoy