Sciweavers

6894 search results - page 1213 / 1379
» Generation Problems
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
16 years 16 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
STACS
2007
Springer
16 years 16 days ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
CODES
2006
IEEE
16 years 14 days ago
Multi-processor system design with ESPAM
For modern embedded systems, the complexity of embedded applications has reached a point where the performance requirements of these applications can no longer be supported by emb...
Hristo Nikolov, Todor Stefanov, Ed F. Deprettere
HICSS
2006
IEEE
163views Biometrics» more  HICSS 2006»
16 years 14 days ago
Learning Ranking vs. Modeling Relevance
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...
Dmitri Roussinov, Weiguo Fan
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
16 years 14 days ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
« Prev « First page 1213 / 1379 Last » Next »