Sciweavers

1897 search results - page 198 / 380
» Mining Chains of Relations
Sort
View
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
15 years 8 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
CADE
2010
Springer
15 years 7 months ago
An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
Yevgeny Kazakov
DAM
2008
123views more  DAM 2008»
15 years 6 months ago
Ultrametrics, Banach's fixed point theorem and the Riordan group
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
Ana Luzón, Manuel A. Morón
CPHYSICS
2006
95views more  CPHYSICS 2006»
15 years 6 months ago
Efficient data processing and quantum phenomena: Single-particle systems
We study the relation between the acquisition and analysis of data and quantum theory using a probabilistic and deterministic model for photon polarizers. We introduce criteria fo...
H. De Raedt, Koen De Raedt, K. Michielsen, S. Miya...
CORR
2007
Springer
81views Education» more  CORR 2007»
15 years 6 months ago
Faster exon assembly by sparse spliced alignment
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
Alexandre Tiskin