Sciweavers

2738 search results - page 188 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 5 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ALT
2003
Springer
16 years 1 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
143
Voted
GLOBECOM
2009
IEEE
15 years 11 months ago
Feasibility Conditions for Interference Alignment
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet ...
WEBI
2007
Springer
15 years 10 months ago
PSSF: A Novel Statistical Approach for Personalized Service-side Spam Filtering
The volume of spam e-mails has grown rapidly in the last two years resulting in increasing costs to users, network operators, and e-mail service providers (ESPs). E-mail users dem...
Khurum Nazir Junejo, Asim Karim
ICAPR
2005
Springer
15 years 10 months ago
Applying Software Analysis Technology to Lightweight Semantic Markup of Document Text
Abstract. Software analysis techniques, and in particular software “design recovery”, have been highly successful at both technical and businesslevel semantic markup of large s...
Nadzeya Kiyavitskaya, Nicola Zeni, James R. Cordy,...