Sciweavers

10608 search results - page 326 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
96
Voted
ISSAC
2005
Springer
110views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Multivariate power series multiplication
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
Éric Schost
GD
1998
Springer
15 years 5 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner
CDES
2008
87views Hardware» more  CDES 2008»
15 years 2 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
122
Voted
CGF
1999
144views more  CGF 1999»
15 years 11 days ago
Occluder Shadows for Fast Walkthroughs of Urban Environments
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and autom...
Peter Wonka, Dieter Schmalstieg
111
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder