Sciweavers

580 search results - page 66 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
AAAI
2007
13 years 11 months ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer
PDPTA
2010
13 years 6 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
DAWAK
1999
Springer
14 years 1 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
GLOBECOM
2010
IEEE
13 years 7 months ago
Reinforcement Learning for Link Adaptation in MIMO-OFDM Wireless Systems
Machine learning algorithms have recently attracted much interest for effective link adaptation due to their flexibility and ability to capture more environmental effects implicitl...
Sungho Yun, Constantine Caramanis
KAIS
2011
129views more  KAIS 2011»
13 years 3 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis