Sciweavers

333 search results - page 54 / 67
» Labels from Reductions: Towards a General Theory
Sort
View
SIGIR
2004
ACM
14 years 1 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
FPL
2004
Springer
100views Hardware» more  FPL 2004»
13 years 11 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...
BCSHCI
2008
13 years 9 months ago
Low cost prototyping: part 1, or how to produce better ideas faster by getting user reactions early and often
Although approaches to User Centered Software Development have existed for almost 20 years a rift still exists between theory and practice. In practice, many software projects are...
Stephen Brown, Andreas Holzinger
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
14 years 1 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...