Sciweavers

281 search results - page 22 / 57
» Balancing weight-balanced trees
Sort
View
IPL
2010
94views more  IPL 2010»
13 years 7 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
PC
2011
413views Management» more  PC 2011»
13 years 3 months ago
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
José Ignacio Aliaga, Matthias Bollhöfe...
ICC
2008
IEEE
135views Communications» more  ICC 2008»
14 years 2 months ago
Testbed Experimentation of a Meshed Tree Routing with Local Link State for Wireless PAN Mesh
— This paper focus on the testbed experimentation of a meshed tree routing algorithm with local link state for Wireless Personal Area networks (WPANs) based on current IEEE 802.1...
Rui Zhang, Tae Rim Park, Myung J. Lee, Hakyung Jun...
RAS
2010
117views more  RAS 2010»
13 years 6 months ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...