Sciweavers

10996 search results - page 233 / 2200
» Future Directions in Computing
Sort
View
SIROCCO
2001
15 years 8 months ago
On Finding Minimum Deadly Sets for Directed Networks
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
Norbert Zeh, Nicola Santoro
ISLPED
2010
ACM
165views Hardware» more  ISLPED 2010»
15 years 6 months ago
Power-efficient directional wireless communication on small form-factor mobile devices
Wireless access is known to be power-hungry for mobile devices. A key reason is that devices radiate power in all directions and much of this power will not reach the destination....
Ardalan Amiri Sani, Hasan Dumanli, Lin Zhong, Ashu...
ICIP
2010
IEEE
15 years 4 months ago
Rotation invariant texture classification using adaptive LBP with directional statistical features
Local Binary Pattern (LBP) has been widely used in texture classification because of its simplicity and computational efficiency. Traditional LBP codes the sign of the local diffe...
Zhenhua Guo, Lei Zhang, David Zhang, Su Zhang
DAC
2009
ACM
16 years 7 months ago
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
Wenwen Chai, Dan Jiao, Cheng-Kok Koh
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
16 years 21 days ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...