- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 246 for paper (0.05 seconds)
-
CITATION.cff
authors: - family-names: Abadi given-names: MartÃn - family-names: AgarwalCreated: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Sep 06 15:26:23 GMT 2021 - 3.5K bytes - Click Count (0) -
src/main/webapp/WEB-INF/view/chat/chat.jsp
aria-label="<la:message key="labels.chat_input_placeholder" />"></textarea> <button type="button" id="sendBtn" class="btn btn-primary" aria-label="<la:message key="labels.chat_send" />"> <i class="fa fa-paper-plane" aria-hidden="true"></i> </button> </div> <div class="input-footer"> <span class="input-hint"><la:message key="labels.chat_input_hint" /></span>
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Mar 19 01:36:02 GMT 2026 - 10.8K bytes - Click Count (0) -
src/main/webapp/WEB-INF/orig/view/chat/chat.jsp
aria-label="<la:message key="labels.chat_input_placeholder" />"></textarea> <button type="button" id="sendBtn" class="btn btn-primary" aria-label="<la:message key="labels.chat_send" />"> <i class="fa fa-paper-plane" aria-hidden="true"></i> </button> </div> <div class="input-footer"> <span class="input-hint"><la:message key="labels.chat_input_hint" /></span>
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 06:21:57 GMT 2026 - 10.4K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
* @author Kurt Alfred Kluever */ enum BloomFilterStrategies implements BloomFilter.Strategy { /** * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the * performance of a Bloom filter (yet only needs two 32bit hash functions). */ MURMUR128_MITZ_32() { @OverrideCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 10.7K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
* and then to XOR them together. The strideTable enables us to hash an int followed by 12 * zero bytes (3 ints), while the byteTable is for advancing one byte at a time. * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget" * by Kadatch and Jenkins, 2010. */ Crc32cHasher() { super(16); } private boolean finished = false; /*Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 28 01:26:26 GMT 2024 - 21.2K bytes - Click Count (0) -
LICENSE
License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names:Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Mon Jan 18 20:25:38 GMT 2016 - 25.8K bytes - Click Count (0) -
doc/go_mem.html
can only have outcomes explained by some sequentially consistent interleaving of the goroutine executions. (The proof is the same as Section 7 of Boehm and Adve's paper cited above.) This property is called DRF-SC. </p> <p> The intent of the formal definition is to match the DRF-SC guarantee provided to race-free programs
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Aug 05 15:41:37 GMT 2025 - 26.6K bytes - Click Count (0) -
LICENSE
You should have received a copy of the GNU Affero General Public License along with this program. If not, see <https://www.gnu.org/licenses/>. Also add information on how to contact you by electronic and paper mail. If your software can interact with users remotely through a computer network, you should also make sure that it provides a way for users to get its source. For example, if your program is a web application, itsCreated: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 33.7K bytes - Click Count (0) -
src/main/webapp/css/font-awesome.min.css
-alt:before{content:"\f87b"}.fa-phone-volume:before{content:"\f2a0"}.fa-photo-video:before{content:"\f87c"}.fa-php:before{content:"\f457"}.fa-pied-piper:before{content:"\f2ae"}.fa-pied-piper-alt:before{content:"\f1a8"}.fa-pied-piper-hat:before{content:"\f4e5"}.fa-pied-piper-pp:before{content:"\f1a7"}.fa-pied-piper-square:before{content:"\f91e"}.fa-piggy-bank:before{content:"\f4d3"}.fa-pills:before{content:"\f484"}.fa-pinterest:before{content:"\f0d2"}.fa-pinterest-p:before{content:"\f231"}.fa-pin...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Dec 14 21:22:25 GMT 2019 - 55.8K bytes - Click Count (2) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
it, or at any rate a book of rules for shutting people up like telescopes: this time she found a little bottle on it, (`which certainly was not here before,' said Alice,) and round the neck of the bottle was a paper label, with the words `DRINK ME' beautifully printed on it in large letters. It was all very well to say `Drink me,' but the wise little Alice was not going to do THAT in a hurry. `No, I'll look
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Click Count (0)