Results 1  10
of
255
Triangle Fixer: Edgebased Connectivity Compression
, 2000
"... Encoding the connectivity of triangle meshes has recently been the subject of intense study and many representations have been proposed [9, 10, 4, 8, 2, 5]. The sudden interest in this area is fueled by the emerging demand for interactive visualization of 3D data sets in a networked environment ( ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(e.g. VRML over the Internet). Since transmission bandwidth across widearea networks is a scarce resource, compact encodings for 3D models are of great advantage. Common representations for triangle meshes use two lists: a list of vertices and a list of triangles. The list of vertices contains
Prˇzulj N: Uncovering Biological Network Function via Graphlet Degree Signatures
 Cancer Inform. 2008, 6(Epub 2008 Apr 14):257–273
"... Motivation: Proteins are essential macromolecules of life and thus understanding their function is of great importance. The number of functionally unclassified proteins is large even for simple and well studied organisms such as baker’s yeast. Methods for determining protein function have shifted th ..."
Abstract

Cited by 52 (1 self)
 Add to MetaCart
their focus from targeting specific proteins based solely on sequence homology to analyses of the entire proteome based on proteinprotein interaction (PPI) networks. Since proteins aggregate to perform a certain function, analyzing structural properties of PPI networks may provide useful clues about
LGRAAL: Lagrangian graphletbased network aligner
, 2015
"... Motivation: Discovering and understanding patterns in networks of protein–protein interactions (PPIs) is a central problem in systems biology. Alignments between these networks aid functional understanding as they uncover important information, such as evolutionary conserved pathways, protein comple ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
alignment tool, Lagrangian GRAphletbased ALigner (LGRAAL), which directly optimizes both the protein and the interaction functional conservations, using a novel alignment search heuristic based on integer programming and Lagrangian relaxation. We compare LGRAAL with the stateoftheart network aligners
RANDOM SAMPLING IN CUT, FLOW, AND NETWORK DESIGN PROBLEMS
, 1999
"... We use random sampling as a tool for solving undirected graph problems. We show that the sparse graph, or skeleton, that arises when we randomly sample a graph’s edges will accurately approximate the value of all cuts in the original graph with high probability. This makes sampling effective for pro ..."
Abstract

Cited by 101 (12 self)
 Add to MetaCart
other cutbased problems, including approximating the best balanced cut of a graph, finding a kconnected orientation of a 2kconnected graph, and finding integral multicommodity flows in graphs with a great deal of excess capacity. Our methods also improve the efficiency of some parallel cut and flow
Networked MIMO with Clustered Linear Precoding
, 2008
"... A clustered base transceiver station (BTS) coordination strategy is proposed for a large cellular MIMO network, which includes full intracluster coordination–to enhance the sum rate–and limited intercluster coordination–to reduce interference for the cluster edge users. Multicell block diagonaliz ..."
Abstract

Cited by 93 (18 self)
 Add to MetaCart
A clustered base transceiver station (BTS) coordination strategy is proposed for a large cellular MIMO network, which includes full intracluster coordination–to enhance the sum rate–and limited intercluster coordination–to reduce interference for the cluster edge users. Multicell block
A Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability Problem
, 1997
"... The classic allterminal network reliability problem posits a graph, each of whose edges fails (disappears) independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. The practical applications of this question to c ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
The classic allterminal network reliability problem posits a graph, each of whose edges fails (disappears) independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. The practical applications of this question
Network Tomography For Internal Delay Estimation
 In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP
, 2001
"... Online, spatially localized information about internal network performance can greatly assist dynamic routing algorithms and traffic transmission protocols. However, it is impractical to measure network traffic at all points in the network. A promising alternative is to measure only at the edge of ..."
Abstract

Cited by 46 (2 self)
 Add to MetaCart
Online, spatially localized information about internal network performance can greatly assist dynamic routing algorithms and traffic transmission protocols. However, it is impractical to measure network traffic at all points in the network. A promising alternative is to measure only at the edge
Estimating Edge Weights in Dynamic Graphs Based on Events
"... Dynamic graphs are ubiquitous in real world applications. They can be found, e.g. in biology, neuroscience, computer science, medicine, social networks, the World Wide Web. There is a great necessity and interest in analyzing these dynamic graphs efficiently. Typically, analysis methods from classic ..."
Abstract
 Add to MetaCart
the social science. For the representation of edge weights in a social network graph we propose a method to efficiently represent the strength of a relation between two entities based on events involving both entities. The Butterworth filter is used to describe the continuous relation that can otherwise only
likelihood and the role of models in molecular phylogenetics.
 Mol. Biol. Evol.
, 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
on T and the parameters on the edges of the tree. Now, for each tree T, there exist parameters for which MP will have a higher probability of returning the ''true tree'' T than M av L. Of course, it is trivial to construct a method that can have a higher reconstruction probability than M av L for a
Results 1  10
of
255