Sciweavers

2414 search results - page 122 / 483
» Computing Normal Subgroups
Sort
View
153
Voted
COMPUTING
2007
81views more  COMPUTING 2007»
15 years 6 months ago
Hybrid curve fitting
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
Martin Aigner, Bert Jüttler
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
15 years 5 months ago
A fast n-dimensional ray-shooting algorithm for grasping force optimization
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
Yu Zheng, Ming C. Lin, Dinesh Manocha
ICPR
2010
IEEE
15 years 4 months ago
Information Theory Based WCE Video Summarization
Wireless Capsule Endoscopy (WCE) is a technical break-through that allows to produce a video of the entire intestine without surgery. It is reported that a medical clinician spend...
Giovanni Gallo, Eliana Granata, Alessandro Torrisi
181
Voted
RTA
1995
Springer
15 years 10 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
OSDI
2004
ACM
16 years 7 months ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...