Sciweavers

780 search results - page 139 / 156
» Structural Performance Evaluation of Multi-Agent Systems
Sort
View
TSP
2008
109views more  TSP 2008»
13 years 7 months ago
Constrained Tensor Modeling Approach to Blind Multiple-Antenna CDMA Schemes
In this paper, we consider an uplink multiple-antenna Code-Division Multiple-Access (CDMA) system linking several multiple-antenna mobile users to one multiple-antenna base-statio...
André L. F. de Almeida, Gérard Favie...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
WWW
2008
ACM
14 years 8 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
ASPLOS
2006
ACM
13 years 9 months ago
Tradeoffs in fine-grained heap memory protection
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
Jianli Shen, Guru Venkataramani, Milos Prvulovic
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
13 years 8 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek