Sciweavers

9842 search results - page 1825 / 1969
» Problem complexity
Sort
View
COLT
2006
Springer
15 years 4 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
131
Voted
CSCLP
2008
Springer
15 years 2 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
129
Voted
DAGSTUHL
2007
15 years 2 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
91
Voted
WCE
2007
15 years 1 months ago
A Proactive Horizontal Handover Algorithm for WiFi-WiMax Interoperable Networks
— Two important high bandwidth wireless certifications in our days are Worldwide Interoperability for Microwave Access (WiMax) and Wireless Fidelity (WiFi). They can interoperate...
Álvaro Suárez Sarmiento, Kholoud Elb...
98
Voted
BMCBI
2010
100views more  BMCBI 2010»
15 years 26 days ago
Using genomic signatures for HIV-1 sub-typing
Background: Human Immunodeficiency Virus type 1 (HIV-1), the causative agent of Acquired Immune Deficiency Syndrome (AIDS), exhibits very high genetic diversity with different var...
Aridaman Pandit, Somdatta Sinha
« Prev « First page 1825 / 1969 Last » Next »