Sciweavers

841 search results - page 121 / 169
» Approximability of Minimum AND-Circuits
Sort
View
COCOON
2005
Springer
14 years 3 months ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan
ICML
2007
IEEE
14 years 11 months ago
Simpler core vector machines with enclosing balls
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...
András Kocsor, Ivor W. Tsang, James T. Kwok
ICCAD
2003
IEEE
141views Hardware» more  ICCAD 2003»
14 years 7 months ago
Passive Synthesis of Compact Frequency-Dependent Interconnect Models via Quadrature Spectral Rules
In this paper, we present a reduced order inodeling methodology, based on the utilization of optimal non-uniform grids generated by Gaussian spectral rules, for the direct passive...
Traianos Yioultsis, Anne Woo, Andreas C. Cangellar...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
COMPGEOM
2009
ACM
14 years 4 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray