Sciweavers

2254 search results - page 203 / 451
» Computing the minimal covering set
Sort
View
ACCV
2007
Springer
16 years 26 days ago
Conic Fitting Using the Geometric Distance
We consider the problem of fitting a conic to a set of 2D points. It is commonly agreed that minimizing geometrical error, i.e. the sum of squared distances between the points and...
Peter F. Sturm, Pau Gargallo
ICIP
2000
IEEE
16 years 8 months ago
Efficiently Estimating Projective Transformations
Projective transformations relate the coordinates of images that are taken by either a camera that undergoes only rotation while imaging an arbitrary scene, or one that rotates an...
Richard J. Radke, Peter J. Ramadge, Tomio Echigo, ...
DAC
2005
ACM
16 years 7 months ago
System-level energy-efficient dynamic task scheduling
Dynamic voltage scaling (DVS) is a well-known low power design technique that reduces the processor energy by slowing down the DVS processor and stretching the task execution time...
Jianli Zhuo, Chaitali Chakrabarti
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
16 years 1 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
RTCSA
2008
IEEE
16 years 1 months ago
Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-...
Bach Duy Bui, Marco Caccamo, Lui Sha, Joseph Marti...