Sciweavers

7168 search results - page 490 / 1434
» A Factorization Approach to Grouping
Sort
View
155
Voted
FIWAC
1993
139views Cryptology» more  FIWAC 1993»
15 years 11 months ago
Montgomery-Suitable Cryptosystems
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
David Naccache, David M'Raïhi
AIIA
2003
Springer
15 years 10 months ago
The Role of Different Solvers in Planning and Scheduling Integration
This paper attempts to analyze the issue of planning and scheduling integration from the point of view of information sharing. This concept is the basic bridging factor between the...
Federico Pecora, Amedeo Cesta
BCSHCI
2008
15 years 8 months ago
Designing for people who do not read easily
Many people do not read easily for all sorts of reasons: social and cultural, because of impairments, or because of their context. Even in the area of impairments, design for peop...
Caroline Jarrett, Katie Grant, B. L. William Wong,...
LREC
2010
155views Education» more  LREC 2010»
15 years 8 months ago
How Specialized are Specialized Corpora? Behavioral Evaluation of Corpus Representativeness for Maltese
In this paper we bring to light a novel intersection between corpus linguistics and behavioral data that can be employed as an evaluation metric for resources for low-density lang...
Jerid Francom, Amy LaCross, Adam Ussishkin
IPCO
2008
91views Optimization» more  IPCO 2008»
15 years 8 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....