Sciweavers

1086 search results - page 112 / 218
» Jug measuring: Algorithms and complexity
Sort
View
PR
2007
189views more  PR 2007»
14 years 9 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
ICIP
2010
IEEE
14 years 7 months ago
Non-rigid image registration by using graph-cuts with mutual information
Non-rigid image registration plays an important role in medical image analysis. Recently, Tang and Chung proposed to model the non-rigid medical image registration problem as an e...
Ronald W. K. So, Albert C. S. Chung
ROBOCUP
2007
Springer
140views Robotics» more  ROBOCUP 2007»
15 years 4 months ago
Tailored Real-Time Simulation for Teams of Humanoid Robots
Abstract. Developing and testing the key modules of autonomous humanoid soccer robots (e.g., for vision, localization, and behavior control) in software-in-the-loop (SIL) experimen...
Martin Friedmann, Karen Petersen, Oskar von Stryk
ISCIS
2005
Springer
15 years 3 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
CSL
2001
Springer
15 years 2 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche