Sciweavers

721 search results - page 126 / 145
» Graphs with Large Obstacle Numbers
Sort
View
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 2 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
TMC
2011
201views more  TMC 2011»
13 years 2 months ago
Data Delivery Properties of Human Contact Networks
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
Nishanth Sastry, D. Manjunath, Karen R. Sollins, J...
JMLR
2010
136views more  JMLR 2010»
13 years 2 months ago
Predicting the functions of proteins in Protein-Protein Interaction networks from global information
In this work we present a novel approach to predict the function of proteins in protein-protein interaction (PPI) networks. We classify existing approaches into inductive and tran...
Hossein Rahmani, Hendrik Blockeel, Andreas Bender
DAC
2002
ACM
14 years 8 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 8 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...