Sciweavers

1080 search results - page 158 / 216
» Problem dependent optimization (PDO)
Sort
View
188
Voted
AI
2002
Springer
15 years 6 months ago
Learning cost-sensitive active classifiers
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
Russell Greiner, Adam J. Grove, Dan Roth
INFOCOM
2008
IEEE
16 years 1 months ago
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, ...
DLOG
2008
15 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
BIRTHDAY
2003
Springer
16 years 5 days ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 8 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets