Sciweavers

42230 search results - page 8002 / 8446
» Algorithms and Complexity Results for
Sort
View
AI
2000
Springer
15 years 7 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
BMCBI
2002
131views more  BMCBI 2002»
15 years 6 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
BMCBI
2002
133views more  BMCBI 2002»
15 years 6 months ago
Identification and characterization of subfamily-specific signatures in a large protein superfamily by a hidden Markov model app
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
Kevin Truong, Mitsuhiko Ikura
CVGIP
2002
126views more  CVGIP 2002»
15 years 6 months ago
Dual Mesh Resampling
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
Gabriel Taubin
JHSN
2000
92views more  JHSN 2000»
15 years 6 months ago
On a class of time varying shapers with application to the renegotiable variable bit rate service
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
Silvia Giordano
« Prev « First page 8002 / 8446 Last » Next »