Sciweavers

103 search results - page 2 / 21
» An improved bound on the number of unit area triangles
Sort
View
JCT
2011
104views more  JCT 2011»
13 years 7 days ago
Bounds for solid angles of lattices of rank three
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Lenny Fukshansky, Sinai Robins
COCOON
2005
Springer
13 years 10 months ago
New Streaming Algorithms for Counting Triangles in Graphs
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
Hossein Jowhari, Mohammad Ghodsi
SMI
2005
IEEE
109views Image Analysis» more  SMI 2005»
13 years 11 months ago
Practical Spherical Embedding of Manifold Triangle Meshes
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
Shadi Saba, Irad Yavneh, Craig Gotsman, Alla Sheff...
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
13 years 9 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
DM
2010
140views more  DM 2010»
13 years 5 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield