Sciweavers

1651 search results - page 282 / 331
» Measuring the Complexity of Classification Problems
Sort
View
WADS
2009
Springer
202views Algorithms» more  WADS 2009»
14 years 3 months ago
Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
Brad Ballinger, David Charlton, Erik D. Demaine, M...
ISSTA
2009
ACM
14 years 3 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
MM
2009
ACM
196views Multimedia» more  MM 2009»
14 years 3 months ago
Mirror world navigation for mobile users based on augmented reality
Finding a destination in unfamiliar environments of complex office building or shopping mall has been always bothering us in daily life. Fine-scale directional guidance, a combina...
Patricia P. Wang, Tao Wang, Dayong Ding, Yimin Zha...
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
14 years 3 months 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
14 years 3 months 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...