Sciweavers

1681 search results - page 43 / 337
» Adaptive Clustering of Search Results
Sort
View
NIPS
1993
13 years 9 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
ANOR
2002
110views more  ANOR 2002»
13 years 7 months ago
Tabu Search with Simple Ejection Chains for Coloring Graphs
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
José Luis González Velarde, Manuel L...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Spying Out Accurate User Preferences for Search Engine Adaptation
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
Lin Deng, Wilfred Ng, Xiaoyong Chai, Dik Lun Lee
TIP
2002
116views more  TIP 2002»
13 years 7 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
CSREASAM
2007
13 years 9 months ago
Survey of Supercomputer Cluster Security Issues
- The authors believe that providing security for supercomputer clusters is different from providing security for stand-alone PCs. The types of programs that supercomputer clusters...
George Markowsky, Linda Markowsky