Sciweavers

973 search results - page 67 / 195
» New Bounds on Crossing Numbers
Sort
View
FOCS
1990
IEEE
15 years 10 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
TROB
2010
58views more  TROB 2010»
15 years 4 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig
CORR
2010
Springer
113views Education» more  CORR 2010»
15 years 6 months ago
Multi-core: Adding a New Dimension to Computing
Invention of Transistors in 1948 started a new era in technology, called Solid State Electronics. Since then, sustaining development and advancement in electronics and fabrication ...
Md. Tanvir Al Amin
STACS
2007
Springer
16 years 8 days ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
JISE
1998
84views more  JISE 1998»
15 years 5 months ago
Determining the Idle Time of a Tiling: New Results
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
Frederic Desprez, Jack Dongarra, Fabrice Rastello,...