Sciweavers

858 search results - page 124 / 172
» One Is Enough!
Sort
View
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
EDBT
2009
ACM
170views Database» more  EDBT 2009»
14 years 23 days ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 11 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
INFOSCALE
2007
ACM
13 years 10 months ago
Scalable problem localization for distributed systems: principles and practices
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
Rui Zhang, Bruno C. d. S. Oliveira, Alan Bivens, S...
DAGSTUHL
2006
13 years 10 months ago
Are we Ready to Embrace the Semantic Web?
action from low level features to high level semantics. Owing to the proliferation of multimedia content in the internet, there is widespread interest in the semantic web community...
Shankar Vembu, Stephan Baumann