Sciweavers

1048 search results - page 6 / 210
» Common Areas At The Heart
Sort
View
SIAMDM
2008
110views more  SIAMDM 2008»
13 years 10 months ago
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
Rom Pinchasi
BMCBI
2006
141views more  BMCBI 2006»
13 years 11 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
IV
2003
IEEE
123views Visualization» more  IV 2003»
14 years 4 months ago
Visualizing Common Ground
The process of analyzing and using information is often collaborative in nature especially given the broad and multi-disciplinary tasks that we must support today. Collaboration r...
Mei C. Chuah, Steven F. Roth
ENGL
2007
94views more  ENGL 2007»
13 years 10 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna