Sciweavers

621 search results - page 108 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
FSTTCS
1993
Springer
13 years 12 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
TKDE
2008
162views more  TKDE 2008»
13 years 7 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
CN
2006
145views more  CN 2006»
13 years 7 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
13 years 9 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
GIS
2009
ACM
14 years 9 months ago
An Interactive Approach to Route Search
A route leads from a start location to a final destination and passes through geospatial entities that are picked according to search terms provided by the user. Each entity is pe...
Yaron Kanza, Roy Levin, Eliyahu Safra, Yehoshua Sa...