Sciweavers

3708 search results - page 306 / 742
» Approximating Betweenness Centrality
Sort
View
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
16 years 8 months ago
Designing a Super-Peer Network
A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a bala...
Beverly Yang, Hector Garcia-Molina
VIS
2004
IEEE
126views Visualization» more  VIS 2004»
16 years 7 months ago
Physically Based Methods for Tensor Field Visualization
The physical interpretation of mathematical features of tensor fields is highly application-specific. Existing visualization methods for tensor fields only cover a fraction of the...
Bernd Hamann, Boris Jeremic, Hans Hagen, Ingrid Ho...
GIS
2008
ACM
16 years 7 months ago
Continuous proximity monitoring in road networks
In this paper, we consider the following scenario: a set of mobile objects continuously track their positions in a road network and are able to communicate with a central server. ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
DAC
2002
ACM
16 years 7 months ago
High-Level specification and automatic generation of IP interface monitors
A central problem in functional verification is to check that a circuit block is producing correct outputs while enforcing that the environment is providing legal inputs. To attac...
Marcio T. Oliveira, Alan J. Hu
ICML
2007
IEEE
16 years 7 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen