Sciweavers

5316 search results - page 358 / 1064
» Which Search Problems Are Random
Sort
View
198
Voted
EWSN
2008
Springer
16 years 7 months ago
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
André Schumacher, Harri Haanpää, ...
ISDA
2009
IEEE
16 years 2 months ago
Valley-Adaptive Clearing Scheme for Multimodal Optimization Evolutionary Search
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...
Mostafa Mostafa Hashim Ellabaan, Yew-Soon Ong
CIKM
2009
Springer
16 years 2 months ago
An analysis framework for search sequences
In this paper we present a general framework to study sequences of search activities performed by a user. Our framework provides (i) a vocabulary to discuss types of features, mod...
Qiaozhu Mei, Kristina Klinkner, Ravi Kumar, Andrew...
ICMCS
2007
IEEE
133views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Data Modeling Strategies for Imbalanced Learning in Visual Search
In this paper we examine a novel approach to the difficult problem of querying video databases using visual topics with few examples. Typically with visual topics, the examples a...
Jelena Tesic, Apostol Natsev, Lexing Xie, John R. ...
ICADL
2003
Springer
147views Education» more  ICADL 2003»
16 years 20 days ago
Effective Image Annotation for Search Using Multi-level Semantics
There is an increasing need of development of automatic tools to annotate images for effective image searching in digital libraries. In this paper, we present a novel probabilistic...
Pu-Jen Cheng, Lee-Feng Chien