Sciweavers

211 search results - page 42 / 43
» Solving Games Without Determinization
Sort
View
108
Voted
CSL
2010
Springer
15 years 15 days ago
Speech separation using speaker-adapted eigenvoice speech models
We present a system for model-based source separation for use on single channel speech mixtures where the precise source characteristics are not known a priori. The sources are mo...
Ron J. Weiss, Daniel P. W. Ellis
95
Voted
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 14 days ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
116
Voted
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
15 years 10 days ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
97
Voted
IJON
2002
104views more  IJON 2002»
15 years 3 days ago
Power and the limits of reactive agents
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
Stefano Nolfi
78
Voted
SCHEDULING
2008
67views more  SCHEDULING 2008»
14 years 12 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade