Sciweavers

2200 search results - page 132 / 440
» Bloch's Constant is Computable
Sort
View
WOLLIC
2009
Springer
16 years 1 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
DEXAW
2008
IEEE
123views Database» more  DEXAW 2008»
16 years 28 days ago
Text Extraction from the Web via Text-to-Tag Ratio
– We describe a method to extract content text from diverse Web pages by using the HTML document’s Text-to-Tag Ratio rather than specific HTML cues that may not be constant acr...
Tim Weninger, William H. Hsu
ISVC
2007
Springer
16 years 18 days ago
Simulation of Flexible Tubes in VR
Abstract. We present a Virtual Reality application enabling interactive, physically correct simulation of tube-like flexible objects. Our objective was to describe flexible objec...
Florian Mannuß, André Hinkenjann, Ger...
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
16 years 3 hour ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
COCOON
2005
Springer
16 years 1 hour ago
Algorithms for Finding Distance-Edge-Colorings of Graphs
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishize...