Sciweavers

2830 search results - page 33 / 566
» No Science without Semantics
Sort
View

Publication
794views
15 years 4 months ago
A Fast Implementation of The Level Set Method Without Solving Partial Differential Equations
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
Yonggang Shi, William Clem Karl
TPHOL
2008
IEEE
14 years 2 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
ASIACRYPT
2004
Springer
14 years 1 months ago
Asynchronous Proactive Cryptosystems Without Agreement (Extended Abstract)
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...
Bartosz Przydatek, Reto Strobl
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 11 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
OOPSLA
2009
Springer
14 years 2 months ago
CZ: multiple inheritance without diamonds
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
Donna Malayeri, Jonathan Aldrich