Sciweavers

271 search results - page 33 / 55
» Comparison of two interactive search refinement techniques
Sort
View
CEC
2005
IEEE
15 years 9 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 3 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
105
Voted
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 9 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
121
Voted
ICPADS
2005
IEEE
15 years 9 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
15 years 4 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...