Sciweavers

17770 search results - page 3536 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
DATAMINE
1999
143views more  DATAMINE 1999»
14 years 11 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
JCT
1998
193views more  JCT 1998»
14 years 11 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
14 years 11 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
SAC
2002
ACM
14 years 11 months ago
Concurrency control for distributed cooperative engineering applications
Distributed cooperative engineering applications require consistent and long-term sharing of large volumes of data, which may cause conflicts due to concurrent read/write operatio...
João Coelho Garcia, Paulo Ferreira
SIGIR
2002
ACM
14 years 11 months ago
Empirical studies in strategies for Arabic retrieval
This work evaluates a few search strategies for Arabic monolingual and cross-lingual retrieval, using the TREC Arabic corpus as the test-bed. The release by NIST in 2001 of an Ara...
Jinxi Xu, Alexander Fraser, Ralph M. Weischedel
« Prev « First page 3536 / 3554 Last » Next »