Sciweavers

1736 search results - page 110 / 348
» On antimagic directed graphs
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 6 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
ICSE
2008
IEEE-ACM
16 years 6 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer
ICDE
2010
IEEE
236views Database» more  ICDE 2010»
16 years 3 months ago
Explaining Structured Queries in Natural Language
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...
Alkis Simitsis, Georgia Koutrika, Yannis E. Ioanni...
WWW
2010
ACM
16 years 1 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
COMPSAC
2009
IEEE
16 years 1 months ago
Software Input Space Modeling with Constraints among Parameters
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...
Sergiy A. Vilkomir, W. Thomas Swain, Jesse H. Poor...