Sciweavers

895 search results - page 97 / 179
» Using graphs for some discrete tomography problems
Sort
View
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
15 years 10 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
DAGM
2004
Springer
15 years 3 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
BMCBI
2006
149views more  BMCBI 2006»
14 years 10 months ago
Identification of biomarkers from mass spectrometry data using a "common" peak approach
Background: Proteomic data obtained from mass spectrometry have attracted great interest for the detection of early-stage cancer. However, as mass spectrometry data are high-dimen...
Tadayoshi Fushiki, Hironori Fujisawa, Shinto Eguch...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
15 years 4 months ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
PDPTA
2007
14 years 11 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker