Sciweavers

278 search results - page 28 / 56
» Two Upper Bounds on the Chromatic Number
Sort
View
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 9 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
IPL
2002
74views more  IPL 2002»
13 years 8 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
APN
1999
Springer
14 years 23 days ago
Structural Methods to Improve the Symbolic Analysis of Petri Nets
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
Enric Pastor, Jordi Cortadella, Marco A. Peñ...
GLOBECOM
2009
IEEE
14 years 3 months ago
Analysis of Degrees of Freedom of Interfering MISO Broadcast Channels
— In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multipleinput single-output (MISO) broadcast channels (BC) where each base sta...
Seokhwan Park, Inkyu Lee
COMPGEOM
2005
ACM
13 years 10 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...