Sciweavers

1644 search results - page 27 / 329
» Finding Dominators in Practice
Sort
View
ICIP
2005
IEEE
14 years 10 months ago
Finding the global minimum for binary image restoration
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
Tony F. Chan, Selim Esedoglu, Mila Nikolova
WEA
2009
Springer
123views Algorithms» more  WEA 2009»
14 years 3 months ago
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
Hannes Moser, Rolf Niedermeier, Manuel Sorge
FMCAD
2009
Springer
14 years 3 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
ICALT
2007
IEEE
14 years 3 months ago
Finding the Right Tool for the Community: Bringing a Wiki-Type Editor to the World of Reusable Learning Objects
In this paper we present a new approach to enabling pedagogically sound reuse and re-purposing of online learning objects in a community of practice. The lack of specific software...
Chu Wang, Hugh C. Davis, Kate Dickens, Gary Wills,...
ISSAC
2004
Springer
93views Mathematics» more  ISSAC 2004»
14 years 2 months ago
Finding the smallest image of a set
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
Steve Linton