Sciweavers

16430 search results - page 370 / 3286
» On Computable Tree Functions
Sort
View
JUCS
2010
148views more  JUCS 2010»
15 years 4 months ago
Applying RFD to Construct Optimal Quality-Investment Trees
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
AINA
2009
IEEE
15 years 3 months ago
A CDMA-Based MAC Protocol in Tree-Topology for Underwater Acoustic Sensor Networks
In this paper, a CDMA-based medium access control (MAC) scheme in underwater acoustic sensor networks is proposed, in which a periodic sleeping mode is jointly employed for the pu...
Jong-Pil Kim, Jae-Won Lee, Youn-Seon Jang, Kweon S...
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
15 years 1 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
LISP
2008
96views more  LISP 2008»
15 years 6 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
ECCV
2006
Springer
16 years 8 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin