Sciweavers

623 search results - page 62 / 125
» An Empirical Study of Query Specificity
Sort
View
DMSN
2010
ACM
13 years 10 months ago
Query-driven data collection and data forwarding in intermittently connected mobile sensor networks
In sparse and intermittently connected Mobile Sensor Networks (MSNs), the base station cannot easily get the data objects acquired by the mobile sensors in the field. When users q...
Wei Wu, Hock-Beng Lim, Kian-Lee Tan
SPIESR
1997
143views Database» more  SPIESR 1997»
13 years 10 months ago
Similarity Evaluation in Image Retrieval Using Simple Features
The development of increasingly complex multimedia applications calls for new methodologies for the organization and retrieval of still images and video sequences. Query and retri...
Eugenio Di Sciascio, Augusto Celentano
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 3 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
JAR
2000
90views more  JAR 2000»
13 years 8 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
14 years 10 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu