Sciweavers

1380 search results - page 94 / 276
» Computing the optimal strategy to commit to
Sort
View
IRREGULAR
1995
Springer
13 years 11 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
CHI
2005
ACM
13 years 9 months ago
Indirect assessment of web navigation success
Despite much research on hypertext and web navigation, relatively little is known about the relationship between web navigation strategies and success. We present two exploratory ...
Jacek Gwizdka, Ian Spence
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 2 days ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ICVS
1999
Springer
14 years 3 days ago
ADORE: Adaptive Object Recognition
Many modern computer vision systems are built by chaining together standard vision procedures, often in graphical programming environments such as Khoros, CVIPtools or IUE. Typical...
Bruce A. Draper, José Bins, Kyungim Baek
MOBIHOC
2005
ACM
14 years 7 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula