Sciweavers

19866 search results - page 178 / 3974
» Computing all factorizations in ***
Sort
View
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
15 years 8 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu
JACM
2007
92views more  JACM 2007»
15 years 6 months ago
Periodicity and unbordered words: A proof of the extended duval conjecture
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word...
Tero Harju, Dirk Nowotka
SIGITE
2005
ACM
16 years 2 days ago
The role of programming in IT
Early in its history as an academic discipline, depth in computer programming was a primary distinguishing factor between IT and older computing disciplines, such as computer scie...
Dianne P. Bills, John A. Biles
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
BMCBI
2010
190views more  BMCBI 2010»
15 years 6 months ago
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
Hsiao Ping Lee, Tzu-Fang Sheu, Chuan Yi Tang