Sciweavers

253 search results - page 13 / 51
» Dynamic Trees and Dynamic Point Location
Sort
View
SEFM
2006
IEEE
14 years 1 months ago
Formalizing AspectJ Weaving for Static Pointcuts
The Aspect Oriented Programming is a new programming paradigm that provides a means of encapsulation of crosscuting concerns in software. This paper describes a formal semantics o...
Nadia Belblidia, Mourad Debbabi
PSYCHNOLOGY
2008
156views more  PSYCHNOLOGY 2008»
13 years 7 months ago
SIM: A dynamic multidimensional visualization method for social networks
Visualization plays an important role in social networks analysis to explore and investigate individual and groups behaviours. Therefore, different approaches have been proposed f...
Maria Chiara Caschera, Fernando Ferri, Patrizia Gr...
BMCBI
2007
217views more  BMCBI 2007»
13 years 7 months ago
OntologyWidget - a reusable, embeddable widget for easily locating ontology terms
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...
Catherine Beauheim, Farrell Wymore, Michael Nitzbe...
CPHYSICS
2004
93views more  CPHYSICS 2004»
13 years 7 months ago
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Gernot Schaller, Michael Meyer-Hermann
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine