Sciweavers

2509 search results - page 216 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
ANLP
1997
114views more  ANLP 1997»
15 years 8 months ago
A Workbench for Finding Structure in Texts
In this paper we report on a set of computational tools with (n)SGML pipeline data flow for uncovering internal structure in natural language texts. The main idea behind the workb...
Andrei Mikheev, Steven Finch
AGP
1994
IEEE
15 years 10 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...

Source Code
2890views
17 years 2 months ago
ImageJ
"ImageJ can display, edit, analyze, process, save, and print 8-bit, 16-bit and 32-bit images. It can read many image formats including TIFF, PNG, GIF, JPEG, BMP, DICOM, FITS, ...
National Institute of Health
COMPGEOM
2009
ACM
15 years 11 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani