Sciweavers

1940 search results - page 146 / 388
» Optimizing search engines using clickthrough data
Sort
View
APL
1998
ACM
15 years 7 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
CEC
2007
IEEE
15 years 9 months ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao
ICWN
2008
15 years 4 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
ICDCS
1999
IEEE
15 years 7 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta