Sciweavers

2125 search results - page 351 / 425
» On Graph Complexity
Sort
View
CCGRID
2009
IEEE
14 years 4 months ago
Performance under Failures of DAG-based Parallel Computing
— As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we pr...
Hui Jin, Xian-He Sun, Ziming Zheng, Zhiling Lan, B...
DSD
2009
IEEE
105views Hardware» more  DSD 2009»
14 years 4 months ago
Design of a Highly Dependable Beamforming Chip
—As CMOS process technology advances towards 32nm, SoC complexity continuously grows but its dependability significantly decreases. In this paper, a beamforming chip 1 is designe...
Xiao Zhang, Hans G. Kerkhoff
ICTAI
2009
IEEE
14 years 4 months ago
EBLearn: Open-Source Energy-Based Learning in C++
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
Pierre Sermanet, Koray Kavukcuoglu, Yann LeCun
INFOCOM
2009
IEEE
14 years 4 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 4 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur