Sciweavers

1071 search results - page 81 / 215
» An analysis framework for search sequences
Sort
View
WWW
2007
ACM
14 years 10 months ago
Organizing and searching the world wide web of facts -- step two: harnessing the wisdom of the crowds
As part of a large effort to acquire large repositories of facts from unstructured text on the Web, a seed-based framework for textual information extraction allows for weakly sup...
Marius Pasca
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 9 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
MM
2010
ACM
164views Multimedia» more  MM 2010»
13 years 7 months ago
Visual search applications for connecting published works to digital material
Visual search connects physical (offline) objects with (online) digital media. Using objects from the environment, like newspapers, magazines, books and posters, we can retrieve s...
Jamey Graham, Jorge Moraleda, Jonathan J. Hull, Ti...
BMCBI
2008
108views more  BMCBI 2008»
13 years 9 months ago
A nonparametric model for quality control of database search results in shotgun proteomics
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
Jiyang Zhang, Jianqi Li, Xin Liu, Hongwei Xie, Yun...
NIPS
2007
13 years 10 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...