Sciweavers

3008 search results - page 529 / 602
» Independence in connected graphs
Sort
View
LREC
2008
159views Education» more  LREC 2008»
15 years 7 months ago
Corpus Exploitation from Wikipedia for Ontology Construction
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
Gaoying Cui, Qin Lu, Wenjie Li, Yi-Rong Chen
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
15 years 7 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
MVA
2007
137views Computer Vision» more  MVA 2007»
15 years 7 months ago
Fingerprint Core and Delta Detection by Candidate Analysis
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
Tomohiko Ohtsuka, Daisuke Watanabe, Hiroyuki Aoki
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 7 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 7 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth