Sciweavers

1376 search results - page 132 / 276
» Searching Trees: An Essay
Sort
View
EDBT
2006
ACM
159views Database» more  EDBT 2006»
16 years 6 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
EWSN
2008
Springer
16 years 6 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ää, ...
ICTAI
2009
IEEE
16 years 1 months ago
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
Éric Grégoire, Bertrand Mazure, Lakh...
LAWEB
2006
IEEE
16 years 15 days ago
Analysis of Web Search Engine Clicked Documents
In this paper we process and analyze web search engine query and click data from the perspective of the documents (URL’s) selected. We initially define possible document categor...
David F. Nettleton, Liliana Calderón-Benavi...
ML
2006
ACM
16 years 13 days ago
Seminal: searching for ML type-error messages
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
Benjamin S. Lerner, Dan Grossman, Craig Chambers