Sciweavers

2520 search results - page 102 / 504
» The complexity of approximating entropy
Sort
View
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 2 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
GPEM
2007
119views more  GPEM 2007»
14 years 10 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski
RSCTC
2004
Springer
134views Fuzzy Logic» more  RSCTC 2004»
15 years 3 months ago
Rough Set Methods in Approximation of Hierarchical Concepts
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
Jan G. Bazan, Sinh Hoa Nguyen, Hung Son Nguyen, An...
WSCG
2003
163views more  WSCG 2003»
14 years 11 months ago
Constructing Approximate Voronoi Diagrams from Digital Images of Generalized Polygons and Circular Objects
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
W. L. Roque, D. Doering