Sciweavers

432 search results - page 34 / 87
» Neighborhood Preserving Embedding
Sort
View
PG
2007
IEEE
15 years 6 months ago
Contour Correspondence via Ant Colony Optimization
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002...
ICCD
2000
IEEE
88views Hardware» more  ICCD 2000»
15 years 8 months ago
Dynamic Flip-Flop with Improved Power
An improved design of a dynamic Flip-Flop is presented. Proposed design overcomes the problem of the glitch at the output and improves Power-Delay Product for about 10%, while pre...
Nikola Nedovic, Vojin G. Oklobdzija
RTAS
2010
IEEE
14 years 10 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 4 days ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
ADHOCNOW
2008
Springer
15 years 6 months ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...