Sciweavers

86 search results - page 9 / 18
» A New Approach to Estimating the Expected First Hitting Time...
Sort
View
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 11 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
GPEM
2002
163views more  GPEM 2002»
13 years 7 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
CEE
2007
107views more  CEE 2007»
13 years 7 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski