Sciweavers

2080 search results - page 358 / 416
» Measuring empirical computational complexity
Sort
View
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
16 years 19 days ago
Accurate Boundary Localization using Dynamic Programming on Snakes
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
EDOC
2008
IEEE
16 years 19 days ago
EA4UP: An Enterprise Architecture-Assisted Telecom Service Development Method
The cost of a telecom service development is correlated to the discontinuity and the complexity of the process. To solve this problem, we propose a method dedicated to telecom ser...
Jacques Simonin, Francis Alizon, Jean-Pierre Desch...
VTC
2008
IEEE
161views Communications» more  VTC 2008»
16 years 16 days ago
Using WLAN Infrastructure for Angle-of-Arrival Indoor User Location
—This paper investigates the potential for future multiple antenna wireless local area network technologies such as 802.11n to perform indoor network-based positioning using angl...
Carl Wong, Richard Klukas, Geoffrey G. Messier
VTS
2008
IEEE
136views Hardware» more  VTS 2008»
16 years 16 days ago
Test-Pattern Grading and Pattern Selection for Small-Delay Defects
Timing-related defects are becoming increasingly important in nanometer technology designs. Small delay variations induced by crosstalk, process variations, powersupply noise, as ...
Mahmut Yilmaz, Krishnendu Chakrabarty, Mohammad Te...
ADHOCNOW
2008
Springer
16 years 16 days 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...