Sciweavers

473 search results - page 19 / 95
» Computing excluded minors
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 7 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
ICML
2008
IEEE
14 years 8 months ago
Stopping conditions for exact computation of leave-one-out error in support vector machines
We propose a new stopping condition for a Support Vector Machine (SVM) solver which precisely reflects the objective of the Leave-OneOut error computation. The stopping condition ...
Klaus-Robert Müller, Pavel Laskov, Vojtech Fr...
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
13 years 11 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
FLAIRS
2010
13 years 9 months ago
Towards A Computational Assessment of Freewriting Quality
This study examines the linguistic features of freewrites and how those features relate to human scores of freewrite quality. Freewriting is a common prewriting strategy that has ...
Jennifer L. Weston, Scott A. Crossley, Danielle S....
CONCURRENCY
1998
130views more  CONCURRENCY 1998»
13 years 7 months ago
JPVM: network parallel computing in Java
The JPVM library is a software system for explicit message-passing based distributed memory MIMD parallel programming in Java. The library supports an interface similar to the C a...
Adam Ferrari