Sciweavers

10988 search results - page 2023 / 2198
» Algorithmic Folding Complexity
Sort
View
MCS
2007
Springer
15 years 9 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
138
Voted
SOFSEM
2007
Springer
15 years 9 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
120
Voted
TACAS
2007
Springer
99views Algorithms» more  TACAS 2007»
15 years 9 months ago
"Don't Care" Modeling: A Logical Framework for Developing Predictive System Models
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
Hillel Kugler, Amir Pnueli, Michael J. Stern, E. J...
COMSWARE
2006
IEEE
15 years 9 months ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
135
Voted
FOCS
2006
IEEE
15 years 9 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
« Prev « First page 2023 / 2198 Last » Next »