Sciweavers

941 search results - page 77 / 189
» Efficient Testing of Large Graphs
Sort
View
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
15 years 10 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICML
2009
IEEE
15 years 10 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
ICTAC
2009
Springer
14 years 7 months ago
Integration Testing from Structured First-Order Specifications via Deduction Modulo
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
Delphine Longuet, Marc Aiguier
INFOCOM
2009
IEEE
15 years 4 months ago
Beyond Trilateration: On the Localizability of Wireless Ad-Hoc Networks
— The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant context...
Zheng Yang, Yunhao Liu, Xiang-Yang Li
ERSA
2010
182views Hardware» more  ERSA 2010»
14 years 7 months ago
Integrating Application Specification and Performance Prediction for Strategic Design-Space Exploration
Abstract--Modeling environments and performance prediction boost application productivity, but often lack integration into an efficient and comprehensive approach to strategic desi...
Brian Holland, Alan D. George, Herman Lam