Sciweavers

1451 search results - page 54 / 291
» Order independence and rationalizability
Sort
View
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
15 years 6 months ago
Short Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
IJCNN
2000
IEEE
15 years 10 months ago
A Constraint Learning Algorithm for Blind Source Separation
In Jutten’s blind separation algorithm, symmetrical distribution and statistical independence of the signal sources are assumed. When they are not satisfied, the learning proce...
Kenji Nakayama, Akihiro Hirano, Motoki Nitta
RT
1998
Springer
15 years 10 months ago
Global Ray-Bundle Tracing with Hardware Acceleration
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
László Szirmay-Kalos, Werner Purgath...
IJCAI
2007
15 years 7 months ago
Vote and Aggregation in Combinatorial Domains with Structured Preferences
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size...
Jérôme Lang
ANLP
1997
119views more  ANLP 1997»
15 years 7 months ago
Dutch Sublanguage Semantic Tagging combined with Mark-Up Technology
In this paper, we want to show how the morphological component of an existing NLP-system for Dutch (Dutch Medical Language Processor - DMLP) has been extended in order to produce ...
Peter Spyns, Ngo Thanh Nhan, Erik Baert, Naomi Sag...