Sciweavers

19320 search results - page 3495 / 3864
» On the complexity of computing determinants
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
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
171
Voted
IPM
2008
133views more  IPM 2008»
15 years 6 months ago
DistanceRank: An intelligent ranking algorithm for web pages
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
Ali Mohammad Zareh Bidoki, Nasser Yazdani
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 6 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
« Prev « First page 3495 / 3864 Last » Next »