Sciweavers

88 search results - page 17 / 18
» A new approach to dynamic all pairs shortest paths
Sort
View
CIMCA
2006
IEEE
13 years 12 months ago
A Junction Based Segmentation Algorithm for Offline Handwritten Connected Character Segmentation
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
U. K. S. Jayarathna, G. E. M. D. C. Bandara
AROBOTS
2008
77views more  AROBOTS 2008»
13 years 5 months ago
Extending obstacle avoidance methods through multiple parameter-space transformations
Obstacle avoidance methods approach the problem of mobile robot autonomous navigation by steering the robot in real-time according to the most recent sensor readings, being suitab...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...
TC
2008
13 years 5 months ago
The Synonym Lookaside Buffer: A Solution to the Synonym Problem in Virtual Caches
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a translation lookaside buffer (TLB). However, this curre...
Xiaogang Qiu, Michel Dubois
SDM
2004
SIAM
214views Data Mining» more  SDM 2004»
13 years 7 months ago
Making Time-Series Classification More Accurate Using Learned Constraints
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
ADHOC
2007
144views more  ADHOC 2007»
13 years 5 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac