Sciweavers

4277 search results - page 211 / 856
» On Multiple Linear Approximations
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
CIS
2004
Springer
15 years 9 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
151
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
EACL
2006
ACL Anthology
15 years 5 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
CAGD
2005
72views more  CAGD 2005»
15 years 3 months ago
Parametrization of approximate algebraic surfaces by lines
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
Sonia Pérez-Díaz, Juana Sendra, J. R...