Sciweavers

19320 search results - page 359 / 3864
» On the complexity of computing determinants
Sort
View
COMCOM
2011
15 years 1 months ago
Palmtree: An IP alias resolution algorithm with linear probing complexity
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
M. Engin Tozal, Kamil Saraç
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
15 years 6 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 10 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
AMC
2007
114views more  AMC 2007»
15 years 7 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
CVPR
2005
IEEE
16 years 8 months ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...