Sciweavers

312 search results - page 12 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
JEA
2010
94views more  JEA 2010»
13 years 2 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
DCC
2007
IEEE
13 years 7 months ago
Practical Binary Adaptive Block Coder
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...
Yuriy A. Reznik
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 11 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
EUROCRYPT
2012
Springer
11 years 10 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
ICIP
2002
IEEE
14 years 9 months ago
Extraction of semantic objects from still images
In this work, we study the extraction of semantic objects from still images. We combine different ideas to extract them in a structured manner together with a perceptual metric th...
Alvaro Pardo