Sciweavers

13603 search results - page 2410 / 2721
» On the Complexity of Computing Treelength
Sort
View
IJCV
2008
173views more  IJCV 2008»
15 years 6 months ago
Fast Non-Rigid Surface Detection, Registration and Realistic Augmentation
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches be...
Julien Pilet, Vincent Lepetit, Pascal Fua
IJMMS
2008
90views more  IJMMS 2008»
15 years 6 months ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
GIS
2006
ACM
15 years 6 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
CCR
2007
85views more  CCR 2007»
15 years 6 months ago
Don't optimize existing protocols, design optimizable protocols
As networks grow in size and complexity, network management has become an increasingly challenging task. Many protocols have tunable parameters, and optimization is the process of...
Jiayue He, Jennifer Rexford, Mung Chiang
IJPP
2008
72views more  IJPP 2008»
15 years 6 months ago
Modulo Path History for the Reduction of Pipeline Overheads in Path-based Neural Branch Predictors
Neural-inspired branch predictors achieve very low branch misprediction rates. However, previously proposed implementations have a variety of characteristics that make them challen...
Gabriel H. Loh, Daniel A. Jiménez
« Prev « First page 2410 / 2721 Last » Next »