Sciweavers

488 search results - page 55 / 98
» The descriptive complexity approach to LOGCFL
Sort
View
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
15 years 3 months ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
EUROMICRO
2009
IEEE
15 years 1 months ago
Service Redundancy Strategies in Service-Oriented Architectures
Redundancy can improve the availability of components in service-oriented systems. However, predicting and quantifying the effects of different redundancy strategies can be a comp...
Nicholas R. May, Heinz W. Schmidt, Ian E. Thomas
ISB
2002
140views more  ISB 2002»
14 years 9 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
LPNMR
2005
Springer
15 years 3 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
WEBI
2005
Springer
15 years 3 months ago
Efficient Extraction of Closed Motivic Patterns in Multi-Dimensional Symbolic Representations of Music
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
Olivier Lartillot