Sciweavers

515 search results - page 25 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
ISER
1995
Springer
100views Robotics» more  ISER 1995»
13 years 12 months ago
Distributed Robotic Manipulation: Experiments in Minimalism
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
Karl-Friedrich Böhringer, Russell Brown, Bruc...
FINTAL
2006
14 years 3 days ago
Discourse Segmentation of German Written Texts
Abstract. Discourse segmentation is the division of a text into minimal discourse segments, which form the leaves in the trees that are used to represent discourse structures. A de...
Harald Lüngen, Csilla Puskás, Maja B&a...
SLIP
2003
ACM
14 years 1 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 11 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
FORTE
1997
13 years 9 months ago
A Framework for Distributed Object-Oriented Testing
Distributed programming and object-oriented programming are two popular programming paradigms. The former is driven by advances in networking technology whereas the latter provide...
Alan C. Y. Wong, Samuel T. Chanson, Shing-Chi Cheu...