Sciweavers

268 search results - page 39 / 54
» Cleaning Interval Graphs
Sort
View
RECOMB
2010
Springer
15 years 5 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
ECOOP
2005
Springer
15 years 3 months ago
Prototypes with Multiple Dispatch: An Expressive and Dynamic Object Model
Two object-oriented programming language paradigms— dynamic, prototype-based languages and multi-method languages— provide orthogonal benefits to software engineers. These two...
Lee Salzman, Jonathan Aldrich
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
KAIS
2008
119views more  KAIS 2008»
14 years 10 months ago
An information-theoretic approach to quantitative association rule mining
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
Yiping Ke, James Cheng, Wilfred Ng
DSN
2002
IEEE
15 years 3 months ago
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
Paolo Santi, Douglas M. Blough