Sciweavers

11211 search results - page 1813 / 2243
» Data Structures
Sort
View
NRHM
2008
106views more  NRHM 2008»
15 years 6 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli
PR
2008
169views more  PR 2008»
15 years 6 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
IJRR
2007
171views more  IJRR 2007»
15 years 6 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars
TCAD
2008
124views more  TCAD 2008»
15 years 6 months ago
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
Neil Kettle, Andy King
CGA
2005
15 years 6 months ago
Bounded Blending for Function-Based Shape Modeling
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
Galina Pasko, Alexander A. Pasko, Tosiyasu L. Kuni...
« Prev « First page 1813 / 2243 Last » Next »