Sciweavers

498 search results - page 65 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
SIGCOMM
2010
ACM
14 years 10 months ago
Multi-hop packet tracking for experimental facilities
The Internet has become a complex system with increasing numbers of end-systems, applications, protocols and types of networks. Although we have a good understanding of how data i...
Tacio Santos, Christian Henke, Carsten Schmoll, Ta...
TSMC
2008
138views more  TSMC 2008»
14 years 9 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 9 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 4 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
15 years 3 months ago
The multi-objective next release problem
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri