Sciweavers

2657 search results - page 189 / 532
» On the complexity of hierarchical problem solving
Sort
View
CRYPTO
2006
Springer
104views Cryptology» more  CRYPTO 2006»
15 years 5 months ago
Random Selection with an Adversarial Majority
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
JSW
2007
106views more  JSW 2007»
15 years 1 months ago
A Multimodal Biometric System Implemented within an Active Database Management System
— Active databases have been used in many different fields to accomplish many different tasks. One of the main problems today that still have not been solved is authorization. In...
Kornelije Rabuzin, Miroslav Baca, Mirko Malekovic
115
Voted
BMCBI
2008
142views more  BMCBI 2008»
15 years 1 months ago
Genetic weighted k-means algorithm for clustering large-scale gene expression data
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
Fang-Xiang Wu
GLOBECOM
2007
IEEE
15 years 8 months ago
Heuristics for the Design and Optimization of Streaming Content Distribution Networks
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
Sandjai Bhulai, Robert D. van der Mei, Mengxiao Wu
CP
2009
Springer
15 years 5 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...