Sciweavers

1404 search results - page 35 / 281
» On General Laws of Complex Networks
Sort
View
MOBIHOC
2006
ACM
15 years 11 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
GEOINFO
2003
15 years 1 months ago
Modelling Spatial Relations by Generalized Proximity Matrices
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data struc...
Ana Paula Dutra de Aguiar, Gilberto Câmara, ...
IJCBDD
2010
127views more  IJCBDD 2010»
14 years 10 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
NETWORKS
2010
14 years 10 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 7 days ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos