Sciweavers

656 search results - page 39 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
ICCS
2007
Springer
14 years 1 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
ICALP
2007
Springer
14 years 1 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
WG
2010
Springer
13 years 6 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...
CSE
2009
IEEE
14 years 2 months ago
A Language of Life: Characterizing People Using Cell Phone Tracks
—Mobile devices can produce continuous streams of data which are often specific to the person carrying them. We show that cell phone tracks from the MIT Reality dataset can be u...
Alexy Khrabrov, George Cybenko
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 1 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro