Sciweavers

4870 search results - page 322 / 974
» Construction of Wavelets and Applications
Sort
View
IJFCS
2006
108views more  IJFCS 2006»
15 years 6 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
SCN
2010
Springer
129views Communications» more  SCN 2010»
15 years 5 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
ACL
2009
15 years 4 months ago
Detecting Compositionality in Multi-Word Expressions
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...
Ioannis Korkontzelos, Suresh Manandhar
DAC
2006
ACM
16 years 7 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
178
Voted
ECCC
2011
207views ECommerce» more  ECCC 2011»
15 years 1 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...