Sciweavers

9842 search results - page 1329 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
236
Voted
EVOW
2010
Springer
15 years 5 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
ICGI
2010
Springer
15 years 5 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
INFOCOM
2010
IEEE
15 years 5 months ago
Optimal SINR-based Random Access
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong, Robe...
JSC
2010
155views more  JSC 2010»
15 years 5 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
221
Voted
PAMI
2010
222views more  PAMI 2010»
15 years 5 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
« Prev « First page 1329 / 1969 Last » Next »