Sciweavers

902 search results - page 143 / 181
» Efficient and Extensible Algorithms for Multi Query Optimiza...
Sort
View
TKDE
2008
162views more  TKDE 2008»
13 years 8 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...
IADIS
2008
13 years 10 months ago
Information Retrieval with Cluster Genetic
This article presents an online cluster using genetic algorithms to increase information retrieval efficiency. The Information Retrieval (IR) is based on the grouping of documents...
José Luis Castillo Sequera, José Ra&...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 8 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
14 years 8 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
IPPS
2010
IEEE
13 years 6 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé