Sciweavers

1700 search results - page 194 / 340
» Combinatorial Pattern Matching
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 4 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
AI
2003
Springer
14 years 3 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
COMPGEOM
2010
ACM
14 years 3 months ago
On the complexity of sets of free lines and line segments among balls in three dimensions
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
Marc Glisse, Sylvain Lazard
HYBRID
2001
Springer
14 years 3 months ago
Diagnosis of Physical Systems with Hybrid Models Using Parametrized Causality
Efficient algorithms exist for fault detection and isolation of physical systems based on functional redundancy. In a qualitative approach, this redundancy can be captured by a tem...
Pieter J. Mosterman
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 19 days ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...