Sciweavers

6004 search results - page 1068 / 1201
» Parallelizing query optimization
Sort
View
EDBT
2012
ACM
216views Database» more  EDBT 2012»
11 years 11 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin
SPAA
2010
ACM
14 years 1 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 9 months ago
Improving classification accuracy using automatically extracted training data
Classification is a core task in knowledge discovery and data mining, and there has been substantial research effort in developing sophisticated classification models. In a parall...
Ariel Fuxman, Anitha Kannan, Andrew B. Goldberg, R...
ICML
1996
IEEE
14 years 9 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
SPAA
2009
ACM
14 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
« Prev « First page 1068 / 1201 Last » Next »