Sciweavers

163 search results - page 18 / 33
» Tight Approximability Results for Test Set Problems in Bioin...
Sort
View
MTA
2000
165views more  MTA 2000»
13 years 7 months ago
Approximating Content-Based Object-Level Image Retrieval
Object-level image retrieval is an active area of research. Given an image, a human observerdoesnot see randomdots of colors. Rather,he she observesfamiliarobjectsin the image. The...
Wynne Hsu, Tat-Seng Chua, Hung Keng Pung
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 5 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
FOCS
2004
IEEE
13 years 11 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
BMCBI
2007
197views more  BMCBI 2007»
13 years 7 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu