Sciweavers

1184 search results - page 103 / 237
» Nearness relations and topology
Sort
View
SOFSEM
2010
Springer
14 years 7 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
VTC
2008
IEEE
236views Communications» more  VTC 2008»
14 years 4 months ago
Apriori-LLR-Threshold-Assisted K-Best Sphere Detection for MIMO Channels
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 3 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
IJRR
2007
100views more  IJRR 2007»
13 years 10 months ago
Exactly Sparse Extended Information Filters for Feature-based SLAM
Recent research concerning the Gaussian canonical form for Simultaneous Localization and Mapping (SLAM) has given rise to a handful of algorithms that attempt to solve the SLAM sc...
Matthew Walter, Ryan Eustice, John J. Leonard
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
14 years 3 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan