Sciweavers

3991 search results - page 604 / 799
» Bounding homogeneous models
Sort
View
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 1 months ago
Subquadratic Algorithms for 3SUM
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
Ilya Baran, Erik D. Demaine, Mihai Patrascu
MSWIM
2004
ACM
14 years 1 months ago
Channel-quality dependent earliest deadline due fair scheduling schemes for wireless multimedia networks
— Providing delay guarantees to time-sensitive traffic in future wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the vari...
Ahmed K. F. Khattab, Khaled M. F. Elsayed
AMAI
2004
Springer
14 years 1 months ago
Biased Minimax Probability Machine for Medical Diagnosis
The Minimax Probability Machine (MPM) constructs a classifier, which provides a worst-case bound on the probability of misclassification of future data points based on reliable ...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
CC
2004
Springer
115views System Software» more  CC 2004»
14 years 1 months ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister
COLT
2004
Springer
14 years 1 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen