Sciweavers

10419 search results - page 1943 / 2084
» Relational information gain
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 7 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
MUC
1992
15 years 10 months ago
GE NLToolset: description of the system as used for MUC-4
The GE NLTooLsET is a set of text interpretation tools designed to be easily adapted to new domains. This report summarizes the system and its performance on the MUG-4 task . INTR...
George B. Krupka, Paul S. Jacobs, Lisa F. Rau, Loi...
NAR
2010
143views more  NAR 2010»
15 years 1 months ago
WormBase: a comprehensive resource for nematode research
WormBase (http://www.wormbase.org) is a central data repository for nematode biology. Initially created as a service to the Caenorhabditis elegans research field, WormBase has evo...
Todd W. Harris, Igor Antoshechkin, Tamberlyn Bieri...
PODC
2012
ACM
13 years 9 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
CVPR
2000
IEEE
16 years 8 months ago
Improving Visual Matching
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
Michael S. Lew, Nicu Sebe, Thomas S. Huang
« Prev « First page 1943 / 2084 Last » Next »