Sciweavers

64 search results - page 7 / 13
» Number of Maximal Partial Clones
Sort
View
RSA
2010
104views more  RSA 2010»
13 years 5 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
13 years 12 months ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst
PODS
1999
ACM
160views Database» more  PODS 1999»
13 years 11 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 11 months ago
Linguistic Rule Extraction by Genetics-Based Machine Learning
This paper shows how linguistic classification knowledge can be extracted from numerical data for pattern classification problems with many continuous attributes by genetic algori...
Hisao Ishibuchi, Tomoharu Nakashima
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 8 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...