Sciweavers

1971 search results - page 363 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 2 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han
ICCS
2005
Springer
14 years 1 months ago
Java-Based Grid Service Spread and Implementation in Remote Sensing Applications
Remote sensing applications often concern very large volumes of spatio-temporal data, the emerging Grid computing technologies bring an effective solution to this problem. The Open...
Yanguang Wang, Yong Xue, Jianqin Wang, Chaolin Wu,...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 2 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 8 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...