Sciweavers

545 search results - page 69 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 4 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
15 years 9 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
ECML
2003
Springer
15 years 9 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
INFOCOM
2010
IEEE
15 years 2 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...
TCOM
2010
167views more  TCOM 2010»
15 years 2 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho