Sciweavers

721 search results - page 106 / 145
» Graphs with Large Obstacle Numbers
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 10 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
SADM
2011
13 years 4 months ago
Trellis display for modeling data from designed experiments
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...
Montserrat Fuentes, Bowei Xi, William S. Cleveland
CN
2008
98views more  CN 2008»
13 years 9 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
KAIS
2008
119views more  KAIS 2008»
13 years 9 months ago
An information-theoretic approach to quantitative association rule mining
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
Yiping Ke, James Cheng, Wilfred Ng
CGF
2008
151views more  CGF 2008»
13 years 8 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...