2635 search results - page 358 / 527 » Algorithms for the Database Layout Problem |
150
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
275
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
175
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
311
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
113
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...