2370 search results - page 130 / 474 » The Characterization of Data-Accumulating Algorithms |
JSC
2007
14 years 9 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
CN
2000
14 years 9 months ago
2000
The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and...
WINET
2002
14 years 9 months ago
2002
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...