Sciweavers

715 search results - page 66 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
ICRA
2002
IEEE
90views Robotics» more  ICRA 2002»
15 years 4 months ago
Distributed Goal Recognition Algorithms for Modular Robots
Modular robots are systems composed of a number of independent units that can be reconfigured to fit the task at hand. When the modules are computationally independent, they for...
Zack J. Butler, Robert Fitch, Daniela Rus, Yuhang ...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 15 hour ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
ENTCS
2008
108views more  ENTCS 2008»
14 years 12 months ago
Modelling Dynamic Software Architectures using Typed Graph Grammars
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
14 years 9 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao