Sciweavers

9842 search results - page 1411 / 1969
» Problem complexity
Sort
View
IANDC
2011
148views more  IANDC 2011»
15 years 2 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
ICDT
2009
ACM
109views Database» more  ICDT 2009»
16 years 8 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
CHI
2004
ACM
16 years 7 months ago
Variation in element and action: supporting simultaneous development of alternative solutions
The complexity of many problems necessitates creating and exploring multiple, alternative solutions. However, current user interfaces do not cleanly support creating alternatives ...
Michael A. Terry, Elizabeth D. Mynatt, Kumiyo Naka...
CADE
2004
Springer
16 years 7 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
« Prev « First page 1411 / 1969 Last » Next »