Sciweavers

1187 search results - page 59 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
COCOON
2008
Springer
14 years 11 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
IJCNN
2000
IEEE
15 years 2 months ago
Incremental Active Learning with Bias Reduction
The problem of designing input signals for optimal generalization in supervised learning is called active learning. In many active learning methods devised so far, the bias of the...
Masashi Sugiyama, Hidemitsu Ogawa
COCOON
1998
Springer
15 years 2 months ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
FOCS
2004
IEEE
15 years 1 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
AAAI
2008
15 years 3 days ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...