Sciweavers

495 search results - page 72 / 99
» Data exchange: computing cores in polynomial time
Sort
View
IOR
2008
104views more  IOR 2008»
13 years 8 months ago
Arrival Rate Approximation by Nonnegative Cubic Splines
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, G&...
KR
2010
Springer
14 years 1 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 1 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 9 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
PAMI
2006
181views more  PAMI 2006»
13 years 8 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka