Sciweavers

715 search results - page 46 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 3 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
CMOT
2004
141views more  CMOT 2004»
13 years 8 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
AIPS
1996
13 years 10 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
WWW
2010
ACM
14 years 3 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
BMCBI
2007
115views more  BMCBI 2007»
13 years 8 months ago
Correlation between structure and temperature in prokaryotic metabolic networks
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...
Kazuhiro Takemoto, Jose C. Nacher, Tatsuya Akutsu