Sciweavers

970 search results - page 105 / 194
» On encodings of spanning trees
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 8 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
ICDM
2010
IEEE
232views Data Mining» more  ICDM 2010»
13 years 6 months ago
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, ...
SMI
2005
IEEE
14 years 2 months ago
Subdomain Aware Contour Trees and Contour Evolution in Time-Dependent Scalar Fields
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
Andrzej Szymczak
ASAP
2002
IEEE
170views Hardware» more  ASAP 2002»
14 years 1 months ago
Reviewing 4-to-2 Adders for Multi-Operand Addition
Recently there has been quite a number of papers discussing the use of redundant 4-to-2 adders for the accumulation of partial products in multipliers, claiming one type to be sup...
Peter Kornerup