Sciweavers

3356 search results - page 284 / 672
» Determining Consensus Numbers
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 4 months ago
Track Layouts of Graphs
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
Vida Dujmovic, Attila Pór, David R. Wood
IR
2000
15 years 4 months ago
New Approaches to Spoken Document Retrieval
This paper presents four novel techniques for open-vocabulary spoken document retrieval: a method to detect slots that possibly contain a query feature; a method to estimate occurr...
Martin Wechsler, Eugen Munteanu, Peter Schäub...
MICRO
2000
IEEE
95views Hardware» more  MICRO 2000»
15 years 4 months ago
Predicting the Future
We present a novel methodology for predicting future outcomes that uses small numbers of individuals participating in an imperfect information market. By determining their risk att...
NN
2000
Springer
161views Neural Networks» more  NN 2000»
15 years 4 months ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
JAL
2002
99views more  JAL 2002»
15 years 4 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch