Sciweavers

877 search results - page 82 / 176
» How to Cover a Grammar
Sort
View
104
Voted
WEBENG
2001
Springer
15 years 5 months ago
A Framework for Defining Acceptance Criteria for Web Development Projects
Despite the rapid evolution of Web technologies and development tools and skills, most Web sites fail (to varying degrees) to achieve their true business goals. This is at least pa...
David Lowe
ISTCS
1993
Springer
15 years 4 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
AAAI
2010
15 years 2 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
97
Voted
APBC
2004
132views Bioinformatics» more  APBC 2004»
15 years 2 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
118
Voted
NIPS
2001
15 years 2 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson