Sciweavers

41 search results - page 8 / 9
» Finding motifs using random projections
Sort
View
FLAIRS
2008
13 years 9 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
COR
2010
146views more  COR 2010»
13 years 7 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 7 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
SIGSOFT
1995
ACM
13 years 11 months ago
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
Adam A. Porter, Harvey P. Siy, Carol A. Toman, Law...
PVLDB
2008
163views more  PVLDB 2008»
13 years 7 months ago
C-DEM: a multi-modal query system for Drosophila Embryo databases
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...
Fan Guo, Lei Li, Christos Faloutsos, Eric P. Xing