Sciweavers

206 search results - page 5 / 42
» Efficient adaptive collect using randomization
Sort
View
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
14 years 13 days ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
DKE
2002
107views more  DKE 2002»
13 years 8 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
ADT
2006
13 years 8 months ago
TICP: Transport Information Collection Protocol
We present and validate TICP, a TCP-friendly reliable transport protocol to collect information from a large number of sources spread over the Internet. TICP is a stand-alone proto...
Chadi Barakat, Mohammad Malli, Naomichi Nonaka
EWC
2002
90views more  EWC 2002»
13 years 8 months ago
An Efficient Adaptive Procedure for Three-Dimensional Fragmentation Simulations
We present a simple set of data structures, and a collection of methods for constructing and updating the structures, designed to support the use of cohesive elements in simulation...
Anna Pandolfi, Michael Ortiz
MOBISYS
2008
ACM
14 years 8 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste