Sciweavers

1697 search results - page 237 / 340
» On Bayesian Case Matching
Sort
View
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
15 years 3 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
131
Voted
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 3 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
CE
2008
89views more  CE 2008»
15 years 2 months ago
An intelligent e-learning system based on learner profiling and learning resources adaptation
Taking advantage of the continuously improving, web-based learning systems plays an important role for self-learning, especially in the case of working people. Nevertheless, learn...
Paraskevi K. Tzouveli, Phivos Mylonas, Stefanos D....
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 2 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
CORR
2006
Springer
136views Education» more  CORR 2006»
15 years 2 months ago
On the Capacity of Multiple Access Channels with State Information and Feedback
In this correspondence, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) t...
Wei Wu, Sriram Vishwanath, Ari Arapostathis