Sciweavers

372 search results - page 12 / 75
» On Finding Small 2-Generating Sets
Sort
View
ACL
2009
14 years 7 months ago
Automatic Set Instance Extraction using the Web
An important and well-studied problem is the production of semantic lexicons from a large corpus. In this paper, we present a system named ASIA (Automatic Set Instance Acquirer), ...
Richard C. Wang, William W. Cohen
BMCBI
2005
103views more  BMCBI 2005»
14 years 9 months ago
Many accurate small-discriminatory feature subsets exist in microarray transcript data: biomarker discovery
Background: Molecular profiling generates abundance measurements for thousands of gene transcripts in biological samples such as normal and tumor tissues (data points). Given such...
Leslie Grate
JCO
2008
134views more  JCO 2008»
14 years 9 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
DIS
2010
Springer
14 years 7 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
HICSS
2002
IEEE
87views Biometrics» more  HICSS 2002»
15 years 2 months ago
Challenges to Collaborative Tool Adoption in a Manufacturing Engineering Setting: A Case Study
This study examined a collaborative tool intervention within a geographically-distributed, engineering-design team in a large manufacturing company. Baseline data collection to de...
Elizabeth E. Wierba, Thomas A. Finholt, Michelle P...