Sciweavers

2561 search results - page 4 / 513
» Enhanced Quicksort Algorithm
Sort
View
AMC
2007
114views more  AMC 2007»
13 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
DAM
2006
79views more  DAM 2006»
13 years 7 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
AMC
2007
108views more  AMC 2007»
13 years 7 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
13 years 8 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
ISCAS
2011
IEEE
205views Hardware» more  ISCAS 2011»
12 years 11 months ago
A new Temporal-Constraint-Based algorithm by handling temporal qualities for video enhancement
—Video enhancement has played very important roles in many applications. However, most existing enhancement methods only focus on the spatial quality within a frame while the tem...
Jun Xie, Weiyao Lin, Hongxiang Li, Ning Xu, Hongyu...