Sciweavers

464 search results - page 80 / 93
» On the Computational Complexity of Hierarchical Radiosity
Sort
View
87
Voted
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 1 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
AUSDM
2008
Springer
225views Data Mining» more  AUSDM 2008»
14 years 11 months ago
Evaluation of Malware clustering based on its dynamic behaviour
Malware detection is an important problem today. New malware appears every day and in order to be able to detect it, it is important to recognize families of existing malware. Dat...
Ibai Gurrutxaga, Olatz Arbelaitz, Jesús M. ...
COMPGEOM
2005
ACM
14 years 11 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
110
Voted
COMPGEOM
2008
ACM
14 years 11 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
EDUTAINMENT
2008
Springer
14 years 11 months ago
Knowledge Discovery by Network Visualization
Hyperlinks among webpages are very important information and are widely used for webpage clustering and webpage ranking. With the explosive growth in the number of webpages availab...
Hong Zhou, Yingcai Wu, Ming-Yuen Chan, Huamin Qu, ...