Sciweavers

4342 search results - page 555 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 10 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 10 months ago
Synthesis-for-testability using transformations
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
NIPS
1996
15 years 8 months ago
Transformation Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation
In pattern recognition, statistical modeling, or regression, the amount of data is a critical factor affecting the performance. If the amount of data and computational resources ar...
Patrice Simard, Yann LeCun, John S. Denker, Bernar...
GLOBECOM
2008
IEEE
15 years 7 months ago
Windowing BitTorrent for Video-on-Demand: Not All is Lost with Tit-for-Tat
—In this paper we present findings from our windowing BitTorrent simulations and show that by carefully optimizing other factors a reasonable level of performance can be achieved...
Petri Savolainen, Niklas Raatikainen, Sasu Tarkoma
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 7 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae